- The Modal Logic S4F, the Default Logic, and the Logic HereandThere Mirosl/aw Truszczy
- On graph equivalences preserved under extensions Zbigniew Lonc1
- APPROXIMATIONS, STABLE OPERATORS, WELL-FOUNDED
- Revision programming Victor W. Marek
- Tools for modeling and solving search Deborah East a Mikhail Iakhiaev b
- [Smu68] R.M. Smullyan. Firstorder logic. Berlin: SpringerVerlag, 1968. [Ull88] J.D. Ullman. Principles of Database and KnowledgeBase Systems. Computer Science Press,
- Algorithms for Maintaining Authorization Base William Brooks, V. Wiktor Marek, Miroslaw Truszczynski
- Annotated revision programs Victor Marek Inna Pivkina Miros/law Truszczy'nski
- The computational complexity of dominance and consistency in CPnets Judy Goldsmith
- Satisfiability and computing van der Waerden numbers # Michael R. Dransfield
- Under consideration for publication in Theory and Practice of Logic Programming 1 Semantic foundations for the view update
- Under consideration for publication in Theory and Practice of Logic Programming 1 Active Integrity Constraints and Revision
- Simple but Hard Mixed Horn Formulas Gayathri Namasivayam and Miroslaw Truszczynski
- Logic Programs with Abstract Constraint Atoms: The Role of Computations
- Simple Random Logic Programs Gayathri Namasivayam and Miroslaw Truszczynski
- Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs
- My Six Encounters with Victor Marek --a Personal Miroslaw Truszczynski
- Hyperequivalence of Logic Programs with Respect to Supported Models Miroslaw Truszczynski
- Declarative Semantics for Revision Programming and Connections to Active Integrity Constraints
- The First Answer Set Programming System Competition Martin Gebser1
- Strong and uniform equivalence of nonmonotonic theories --an algebraic approach
- Nonmonotonic logics and their algebraic foundations Miroslaw Truszczynski
- Strong and uniform equivalence of nonmonotonic theories --an algebraic Miroslaw Truszczynski
- Properties of Programs with Monotone and Convex Constraints Lengning Liu and Miroslaw Truszczynski
- Tools for modeling and solving search problems Deborah East1
- Satisfiability and computing van der Waerden numbers Michael R. Dransfield
- Answer Set Optimization Gerhard Brewka
- Computing minimal models, stable models and answer sets
- Constraint Lingo: A program for solving logic puzzles and other tabular constraint problems.
- Propositional satis ability in answer-set programming
- aspps | an implementation of answer-set programming with propositional schemata
- Fixed-parameter complexity of semantics for logic programs
- Default Reasoning System DeReS Pawel Cholewinski
- [Smu68] R.M. Smullyan. First-order logic. Berlin: Springer-Verlag, 1968. [Ull88] J.D. Ullman. Principles of Database and Knowledge-Base Systems. Computer Science Press,
- On the accuracy and running time of GSAT Deborah East and Miroslaw Truszczynski
- In nitary Default Logic for Speci cation of Nonmonotonic Reasoning
- Journal of Artificial Intelligence Research X (X) X Submitted X; published X The Computational Complexity of Dominance and Consistency in
- Fundamenta Informaticae 34 (1999) 1--21 1 Contributions to the Theory of Rough Sets
- Comments on Modeling Languages for AnswerSet Programming
- Constraint Lingo: Towards high-level constraint programming
- Logic Programs with Abstract Constraint Atoms: The Role of Computations
- Fixedparameter complexity of semantics for logic ZBIGNIEW LONC
- Infinitary Default Logic for Specification of Nonmonotonic Reasoning
- Properties of Programs with Monotone and Convex Constraints Lengning Liu and Mirosl/aw Truszczy
- Predicatecalculus based logics for modeling and solving search problems
- Annotated revision programs Victor Marek, Inna Pivkina, and Miros/law Truszczy'nski
- Constrained and rational default logics Artur Mikitiuk and Miros/law Truszczy'nski
- On the problem of computing the wellfounded semantics 1 Zbigniew Lonc 2 and Miros/law Truszczy'nski
- The aspps system Deborah East1 and Miroslaw Truszczynski2
- Algorithms for Maintaining Authorization Base William Brooks, V. Wiktor Marek, Miroslaw Truszczynski
- Local-search techniques for propositional logic extended with cardinality constraints
- Tools for modeling and solving search problems Deborah East 1 , Mikhail Iakhiaev 2 , Artur Mikitiuk 2 , and Miros#law
- Constraint Lingo: A program for solving logic puzzles and other tabular constraint problems.
- Strong and uniform equivalence of nonmonotonic theories ---an algebraic approach #
- Hyperequivalence of Logic Programs with Respect to Supported Models Miroslaw Truszczynski
- Declarative Semantics for Active Integrity Constraints Luciano Caroprese1
- Under consideration for publication in Theory and Practice of Logic Programming 1 Logic programs with monotone abstract
- Fixedparameter complexity of semantics for logic programs
- Nonmonotonic reasoning is sometimes simpler!1 Grigori Schwarz
- Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic
- Under consideration for publication in Theory and Practice of Logic Programming 1 Transition Systems for Model Generators --A
- Relativized Hyperequivalence of Logic Programs for Modular Programming
- Fixpoint 3valued semantics for autoepistemic Marc Denecker 1 , V. Wiktor Marek 2 , and Miros/law Truszczy'nski 2
- Under consideration for publication in Theory and Practice of Logic Programming 1 On the problem of computing the well-founded
- Localsearch techniques for propositional logic extended with cardinality constraints
- The aspps system Deborah East 1 and Miros/law Truszczy'nski 2
- Representing Preferences Among Sets Gerhard Brewka
- Trichotomy Results on the Complexity of Reasoning with Disjunctive Logic Programs
- Ultimate approximation and its application in nonmonotonic knowledge representation
- Strong and uniform equivalence of nonmonotonic theories ---an algebraic Mirosl/aw Truszczy
- aspps ---an implementation of answerset programming with propositional schemata
- Proceedings of the 12th International Con ference on Logic Programming, MIT Press,
- Skeptical Rational Extensions Artur Mikitiuk and Miroslaw Truszczynski
- Nonmonotonic reasoning is sometimes simpler! 1 Grigori Schwarz
- Automatic generation of Englishlanguage steps in puzzle solving Hemantha Ponnuru, Raphael Finkel, Victor Marek, and Mirosl/aw Truszczynski
- Comments on Modeling Languages for Answer-Set Programming
- An Smodels System with Limited Lookahead Computation
- Revisiting Epistemic Specifications Miroslaw Truszczynski
- Generating cellular puzzles with logic programs Raphael Finkel Wiktor Marek Mirek Truszczynski
- Propositional satisfiability in answerset programming
- Localsearch techniques for boolean combinations of pseudoboolean constraints Lengning Liu and Mirosl/aw Truszczy
- Prioritized Component Systems Gerhard Brewka
- Tools for modeling and solving search Deborah East a Mikhail Iakhiaev b
- Uniform semantic treatment of default and autoepistemic logics \Lambda Marc Denecker
- Semantics of Disjunctive Programs with Monotone Aggregates ---an Operatorbased Approach
- Computing with default logic \Lambda Pawe/l Cholewi'nski
- Minimal number of permutations sufficient to compute all extensions a finite default theory
- Extremal problems in logic program-ming and stable model computation
- Logic programs with monotone cardinality atoms Victor W. Marek 1 , Ilkka Niemela 2 , and Miros law Truszczy nski 1
- Logic programming with costs Victor W. Marek
- APPROXIMATIONS, STABLE OPERATORS, WELLFOUNDED
- Fixpoint 3-valued semantics for autoepistemic Marc Denecker1
- Constrained and rational default logics Artur Mikitiuk and Miroslaw Truszczynski
- Computing minimal models, stable models and answer sets
- Satisfiability Testing of Boolean Combinations of Pseudo-Boolean Constraints using Local-search
- Minimal number of permutations su cient to compute all extensions a nite default theory
- On the number of minimal transversals in 3-uniform hypergraphs Zbigniew Lonc
- Semantics of Disjunctive Programs with Monotone Aggregates --an Operator-based Approach
- Annotated revision programs Victor Marek Inna Pivkina Miroslaw Truszczynski
- On the problem of computing the well-founded semantics1 Zbigniew Lonc2 and Miroslaw Truszczynski
- Ultimate approximation and its application in nonmonotonic knowledge representation
- Predicate-calculus based logics for modeling and solving search problems
- Local-search techniques for boolean combinations of pseudo-boolean constraints Lengning Liu and Miroslaw Truszczynski
- Properties and applications of programs with monotone and convex constraints
- Fixed-parameter complexity of semantics for logic ZBIGNIEW LONC
- Representation Theory for Default Logic V. Wiktor Marek 1 Jan Treur 2 and Miros/law Truszczy'nski 3
- An Smodels System with Limited Lookahead Computation
- Properties and applications of programs with monotone and convex constraints #
- Logic programming with costs Victor W. Marek
- On the accuracy and running time of GSAT Deborah East and Miroslaw Truszczynski
- Ultimate approximations in nonmonotonic knowledge representation Marc Denecker
- Approximating Answer Sets of Unitary LifschitzWoo Victor W. Marek 1 , Inna Pivkina 2 , and Mirosl/aw Truszczy nski 1
- Answer Set Optimization \Lambda Gerhard Brewka
- Extremal problems in logic program ming and stable model computation
- Revision programming Victor W. Marek
- Fixpoint 3valued semantics for autoepistemic logic Marc Denecker
- WSAT(CC ) | a fast local-search ASP solver Lengning Liu and Miros law Truszczy nski
- Under consideration for publication in Theory and Practice of Logic Programming 1 Logic programs with monotone abstract
- Nonmonotonic logics and their algebraic foundations Mirosl/aw Truszczy nski
- Skeptical Rational Extensions Artur Mikitiuk and Miros/law Truszczy'nski
- Representation Theory for Default Logic V. Wiktor Marek1 Jan Treur2 and Miroslaw Truszczynski3
- Under consideration for publication in Theory and Practice of Logic Programming 1 Relativized Hyperequivalence of Logic Programs
- Ultimate approximations in nonmonotonic knowledge representation Marc Denecker
- Default Reasoning System DeReS Pawe/l Cholewi'nski \Lambda
- Logic Programming for Knowledge Representation