Victor W. Marek

Orcid: 0000-0002-1369-5177

Affiliations:
  • University of Kentucky, Lexington, KY, USA


According to our database1, Victor W. Marek authored at least 140 papers between 1973 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Pairwise comparisons matrix decomposition into approximation and orthogonal component using Lie theory.
Int. J. Approx. Reason., 2021

2020
Answer Set Programming, by Vladimir Lifschitz, Springer NatureSwitzerland AG, ISBN 978-3-030-24657-0.
Theory Pract. Log. Program., 2020

On the complexity of index sets for finite predicate logic programs which allow function symbols.
J. Log. Comput., 2020

On the use of group theory to generalize elements of pairwise comparisons matrix: A cautionary note.
Int. J. Approx. Reason., 2020

2018
An Edge-Focused Model for Distributed Streaming Data Applications.
Proceedings of the 2018 IEEE International Conference on Pervasive Computing and Communications Workshops, 2018

Edge-enabled Distributed Network Measurement.
Proceedings of the 2018 IEEE International Conference on Pervasive Computing and Communications Workshops, 2018

2017
Solving Very Hard Problems: Cube-and-Conquer, a Hybrid SAT Solving Method.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

2016
<i>All about Proofs, Proofs for All</i>, Bruno Woltzenlogel Paleo and David Delahaye, Eds., College Publications, Series Mathematical Logic and Foundations, vol. 55., 2015. Paperback, ISBN 978-1-84890-166-7, vii + 240 pages.
Theory Pract. Log. Program., 2016

Preface.
Fundam. Informaticae, 2016

Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2016, 2016

Collating time-series resource data for system-wide job profiling.
Proceedings of the 2016 IEEE/IFIP Network Operations and Management Symposium, 2016

Index Sets for Finite Normal Predicate Logic Programs with Function Symbols.
Proceedings of the Logical Foundations of Computer Science - International Symposium, 2016

Constellation: A secure self-optimizing framework for genomic processing.
Proceedings of the 18th IEEE International Conference on e-Health Networking, 2016

Working with Zdzislaw Pawlak - Personal Reminiscences.
Proceedings of the 2016 Federated Conference on Computer Science and Information Systems, 2016

Cresco: A distributed agent-based edge computing framework.
Proceedings of the 12th International Conference on Network and Service Management, 2016

2014
Rough Sets and Matroids.
Trans. Rough Sets, 2014

Satisfiability-based Set Membership Filters.
J. Satisf. Boolean Model. Comput., 2014

Scalable hybrid stream and hadoop network analysis system.
Proceedings of the ACM/SPEC International Conference on Performance Engineering, 2014

2013
Professor Zdzisław Pawlak (1926-2006): Founder of the Polish School of Artificial Intelligence.
Proceedings of the Rough Sets and Intelligent Systems - Professor Zdzisław Pawlak in Memoriam, 2013

Zdzisław Pawlak, Databases and Rough Sets.
Proceedings of the Rough Sets and Intelligent Systems - Professor Zdzisław Pawlak in Memoriam, 2013

Index sets for Finite Normal Predicate Logic Programs
CoRR, 2013

2012
Disjunctive Programs with Set Constraints.
Proceedings of the Correct Reasoning, 2012

2011
Guarded resolution for Answer Set Programming.
Theory Pract. Log. Program., 2011

Preface.
Fundam. Informaticae, 2011

Origins of Answer-Set Programming - Some Background And Two Personal Accounts
CoRR, 2011

Reiter's Default Logic Is a Logic of Autoepistemic Reasoning And a Good One, Too
CoRR, 2011

Effectively Reasoning about Infinite Sets in Answer Set Programming.
Proceedings of the Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning, 2011

2009
An Application of Proof-Theory in answer Set Programming
CoRR, 2009

The complexity of recursive constraint satisfaction problems.
Ann. Pure Appl. Log., 2009

Automata and Answer Set Programming.
Proceedings of the Logical Foundations of Computer Science, International Symposium, 2009

2008
Approximation Schemes in Logic and Artificial Intelligence.
Trans. Rough Sets, 2008

Logic programs with monotone abstract constraint atoms.
Theory Pract. Log. Program., 2008

Set based logic programming.
Ann. Math. Artif. Intell., 2008

On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP.
Proceedings of the Logic Programming, 24th International Conference, 2008

Quo Vadis Answer Set Programming?
Proceedings of the Logic Programming, 24th International Conference, 2008

2007
Characterizing Pawlak's Approximation Operators.
Trans. Rough Sets, 2007

Explanatory Nonmonotonic Reasoning by Alexander Bochman, World Scientific, Hardback: ISBN 981-256-101-3, xiv + 408 pages.
Theory Pract. Log. Program., 2007

Compactness Properties for Stable Semantics of Logic Programs.
Fundam. Informaticae, 2007

Rough Sets and Approximation Schemes.
Proceedings of the Rough Sets and Intelligent Systems Paradigms, International Conference, 2007

2006
Generating Cellular Puzzles with Logic Programs.
Proceedings of the 2006 International Conference on Artificial Intelligence, 2006

2005
Toward Automating the Discovery of Decreasing Measures.
J. Autom. Reason., 2005

Logic programming with infinite sets.
Ann. Math. Artif. Intell., 2005

Approximating Answer Sets of Unitary Lifschitz-Woo Programs.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2005

Set Based Logic Programming.
Proceedings of the Nonmonotonic Reasoning, 2005

Normal Form Theorem for Logic Programs with Cardinality Constraints.
Proceedings of the Nonmonotonic Reasoning, 2005

2004
Constraint Lingo: towards high-level constraint programming.
Softw. Pract. Exp., 2004

Ultimate approximation and its application in nonmonotonic knowledge representation systems.
Inf. Comput., 2004

Satisfiability and Computing van der Waerden Numbers.
Electron. J. Comb., 2004

Answer set programming with default logic.
Proceedings of the 10th International Workshop on Non-Monotonic Reasoning (NMR 2004), 2004

Set Constraints in Logic Programming.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2004

Logic Programs With Monotone Cardinality Atoms.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2004

Using Logic Programs to Reason about Infinite Sets.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2004

Automatic Generation of English-language Steps in Puzzle Solving.
Proceedings of the International Conference on Artificial Intelligence, 2004

Logic Programs with Abstract Constraint Atoms.
Proceedings of the Nineteenth National Conference on Artificial Intelligence, 2004

2003
On the expressibility of stable logic programming.
Theory Pract. Log. Program., 2003

Uniform semantic treatment of default and autoepistemic logics.
Artif. Intell., 2003

Satisfiability and Computing van der Waerden Numbers.
Proceedings of the Theory and Applications of Satisfiability Testing, 2003

2002
Annotated revision programs.
Artif. Intell., 2002

On logic programs with cardinality constraints.
Proceedings of the 9th International Workshop on Non-Monotonic Reasoning (NMR 2002), 2002

Ultimate Approximations in Nonmonotonic Knowledge Representation Systems.
Proceedings of the Eights International Conference on Principles and Knowledge Representation and Reasoning (KR-02), 2002

Constraint Lingo: A Program for Solving Logic Puzzles and Other Tabular Constraint Problems.
Proceedings of the Logics in Artificial Intelligence, European Conference, 2002

2001
Logic programming revisited: Logic programs as inductive definitions.
ACM Trans. Comput. Log., 2001

Foundations of Mathematics in the Twentieth Century.
Am. Math. Mon., 2001

Default logic and specification of nonmonotonic reasoning.
J. Exp. Theor. Artif. Intell., 2001

On the Foundations of Answer Set Programming.
Proceedings of the Answer Set Programming, 2001

Tabular Constraint-Satisfaction Problems and Answer Set Programming.
Proceedings of the Answer Set Programming, 2001

Computing stable models in parallel.
Proceedings of the Answer Set Programming, 2001

2000
Uniform semantic treatment of default and autoepistemic logic.
Proceedings of the KR 2000, 2000

1999
Contributions to the Theory of Rough Sets.
Fundam. Informaticae, 1999

Logic Programs, Well-Orderings, and Forward Chaining.
Ann. Pure Appl. Log., 1999

Computing with Default Logic.
Artif. Intell., 1999

Stable Models and an Alternative Logic Programming Paradigm.
Proceedings of the Logic Programming Paradigm - A 25-Year Perspective, 1999

1998
Revision Programming.
Theor. Comput. Sci., 1998

Applications of the JAVA Programming Language to Database Management.
SIGMOD Rec., 1998

Stable models and an alternative logic programming paradigm
CoRR, 1998

Myths about Rough Set Theory.
Commun. ACM, 1998

Rough Sets - What Are They About?
Proceedings of the Rough Sets and Current Trends in Computing, 1998

Revision Programming = Logic Programming + Integrity Constraints.
Proceedings of the Computer Science Logic, 12th International Workshop, 1998

Simulating patients with Parallel Health State Networks.
Proceedings of the AMIA 1998, 1998

Fixpoint 3-Valued Semantics for Autoepistemic Logic.
Proceedings of the Fifteenth National Conference on Artificial Intelligence and Tenth Innovative Applications of Artificial Intelligence Conference, 1998

1997
Complexity of Recursive Normal Default Logic.
Fundam. Informaticae, 1997

Nonmonotonic rule systems with recursive sets of restraints.
Arch. Math. Log., 1997

Representation Theory for Default Logic.
Ann. Math. Artif. Intell., 1997

Basic Forward Chaining Construction for Logic Programs.
Proceedings of the Logical Foundations of Computer Science, 4th International Symposium, 1997

Intelligent Computation of Presentation Documents.
Proceedings of the Foundations of Intelligent Systems, 10th International Symposium, 1997

1996
Reducing Disjunctive to Non-Disjunctive Semantics by Shift-Operations.
Fundam. Informaticae, 1996

On the Complexity of Abduction.
Proceedings of the Proceedings, 1996

Default Reasoning System DeReS.
Proceedings of the Fifth International Conference on Principles of Knowledge Representation and Reasoning (KR'96), 1996

Infinitary Default Logic for Specification of Nonmonotonic Reasoning.
Proceedings of the Logics in Artificial Intelligence, European Workshop, 1996

Toward Intelligent Representation of Database Content.
Proceedings of the Foundations of Intelligent Systems, 9th International Symposium, 1996

1995
Complexity of Computing with Extended Propositional Logic Programs.
Ann. Math. Artif. Intell., 1995

The Expressiveness of Locally Stratified Programs.
Ann. Math. Artif. Intell., 1995

Algorithms for Maintaining Authorization Bases.
Proceedings of the 1995 International Conference on Object Oriented Information Systems, 1995

Complexity of Normal Default Logic and Related Modes of Nonmonotonic Reasoning
Proceedings of the Proceedings, 1995

Experimenting with Nonmonotonic Reasoning.
Proceedings of the Logic Programming, 1995

Revision Programming, Database Updates and Integrity Constraints.
Proceedings of the Database Theory, 1995

1994
Introduction.
Methods Log. Comput. Sci., 1994

The Stable Models of a Predicate Logic Program.
J. Log. Program., 1994

A Context for Belief Revision: Forward Chaining - Normal Nonmonotonic Rule Systems.
Ann. Pure Appl. Log., 1994

On Logical Constraints in Logic Programming.
Proceedings of the ILPS 1994, 1994

Revision Specifications by Means of Programs.
Proceedings of the Logics in Artificial Intelligence, European Workshop, 1994

Causal Models of Disjunctive Logic Programs.
Proceedings of the Logic Programming, 1994

1993
Mechanical Proof Systems for Logic II, Consensus Programs and Their Processing.
J. Intell. Inf. Syst., 1993

Modal Nonmonotonic Logics: Ranges, Characterization, Computation.
J. ACM, 1993

Reflective Autoepistemic Logic and Logic Programming.
Proceedings of the Logic Programming and Non-monotonic Reasoning, 1993

Complexity Issues in Nonmonotonic Logic and Logic Programming (Abstract).
Proceedings of the Computational Logic and Proof Theory, Third Kurt Gödel Colloquium, 1993

Mechanical Proof Systems for Logic II, Consensus Programs and Their Procedding (Extended Abstract).
Proceedings of the Methodologies for Intelligent Systems, 7th International Symposium, 1993

Nonmonotonic logic - context-dependent reasoning.
Artificial intelligence, Springer, ISBN: 0-387-56448-9, 1993

1992
The Relationship Between Stable, Supported, Default and Autoepistemic Semantics for General Logic Programs.
Theor. Comput. Sci., 1992

The Pure Logic of Necessitation.
J. Log. Comput., 1992

More on modal aspects of default logic.
Fundam. Informaticae, 1992

How Complicated is the Set of Stable Models of a Recursive Logic Program?
Ann. Pure Appl. Log., 1992

A Theory of Nonmonotonic Rule Systems II.
Ann. Math. Artif. Intell., 1992

Rule Systems and Well-Orderings.
Proceedings of the Informal Proceedings of the Workshop Structural Complexity and Recursion-theoretic methods in Logic-Programming, 1992

1991
Autoepistemic Logic.
J. ACM, 1991

Normal Form Results for Default Logic.
Proceedings of the Nonmonotonic and Inductive Logic, 1991

Computing Intersection of Autoepistemic Expansions.
Proceedings of the Logic Programming and Non-monotonic Reasoning, 1991

1990
Modal Logic for Default Reasoning.
Ann. Math. Artif. Intell., 1990

A Theory of Nonmonotonic Rule Systems I.
Ann. Math. Artif. Intell., 1990

Ranges of Strong Modal Nonmonotonic Logics.
Proceedings of the Nonmonotonic and Inductive Logic, 1990

A Theory of Nonmonotonic Rule Systems
Proceedings of the Fifth Annual Symposium on Logic in Computer Science (LICS '90), 1990

1989
Stable Semantics for Logic Programs and Default Theories.
Proceedings of the Logic Programming, 1989

Relating Autoepistemic and Default Logics.
Proceedings of the 1st International Conference on Principles of Knowledge Representation and Reasoning (KR'89). Toronto, 1989

The Relationship Between Logic Program Semantics and Non-Monotonic Reasoning.
Proceedings of the Logic Programming, 1989

On the Classification and Existence of Structures in Default Logic.
Proceedings of the EPIA 89, 1989

1988
A Natural Semantics for Modal Logic Over Databases.
Theor. Comput. Sci., 1988

Book review: The Art of Prolog Advanced Programming Techniques by L. Sterling and E. Shapiro (The MIT Press).
SIGART Newsl., 1988

1987
Book review: Combinatorics, Set Systems, Hypergraphs, Families of Vectors and Combinatorial Probability by B. Bollobas (Cambridge University Press).
SIGART Newsl., 1987

Investigating Logical Properties of the Rule-Based Expert Systems Using Combinatorial and Geometrical Techniques I.
Proceedings of the Methodologies for Intelligent Systems, 1987

1986
Approximating Sets with Equivalence Relations.
Theor. Comput. Sci., 1986

Executing Temporal Logic Programs by Ben Moszkowski.
SIGART Newsl., 1986

Completeness and Consistency in Knowledge Base Systems.
Proceedings of the Expert Database Systems, 1986

1984
A Natural Semantics for Modal Logic over Databases and Model-Theoretic Forcing.
Proceedings of the Non-Monotonic Reasoning Workshop, 1984

1982
On Some σ-Algebras Containing the Projective Sets I.
Math. Log. Q., 1982

1979
Information systems: on queries involving cardinalities.
Inf. Syst., 1979

1976
Information Storage and Retrieval Systems: Mathematical Foundations.
Theor. Comput. Sci., 1976

1975
No minimal transitive model of Z<sup>-</sup>.
Math. Log. Q., 1975

1974
File Organization, An Application of Graph Theory.
Proceedings of the Automata, Languages and Programming, 2nd Colloquium, University of Saarbrücken, Germany, July 29, 1974

1973
Observations Concerning Elementary Extensions of omega-Models. II.
J. Symb. Log., 1973

On Transitive Models for Fragments of Set Theory.
Bull. Acad. Pol. des Sci. Ser. Sci. Math. Astron. Phys., 1973


  Loading...