Foundations of logic programming
Foundations of logic programming
The well-founded semantics for general logic programs
Journal of the ACM (JACM)
On the relations between stable and well-founded semantics of logic programs
Theoretical Computer Science - Selected papers of the Second International Conference on algebraic and logic programming, Nancy, France, October 1–3, 1990
Implementing stable semantics by linear programming
Proceedings of the second international workshop on Logic programming and non-monotonic reasoning
Proceedings of the eleventh international conference on Logic programming
The expressive powers of the logic programming semantics
Selected papers of the 9th annual ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Tabled evaluation with delaying for general logic programs
Journal of the ACM (JACM)
A non-ground realization of the stable and well-founded semantics
Theoretical Computer Science
WFS + Branch and Bound = Stable Models
IEEE Transactions on Knowledge and Data Engineering
Computation of Stable Models and Its Integration with Logical Query Processing
IEEE Transactions on Knowledge and Data Engineering
Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
Skeptical Query-Answering in Constrained Default Logic
FAPR '96 Proceedings of the International Conference on Formal and Applied Practical Reasoning
Resolution for Skeptical Stable Semantics
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
Smodels - An Implementation of the Stable Model and Well-Founded Semantics for Normal LP
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
Sequent Calculi for Default and Autoepistemic Logics
TABLEAUX '96 Proceedings of the 5th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods
A Sequent Calculus for Skeptical Default Logic
TABLEAUX '97 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
A Sequent Calculus for Circumscription
CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
Reasoning with infinite stable models
Artificial Intelligence
Graphs and colorings for answer set programming
Theory and Practice of Logic Programming
Complexity results for answer set programming with bounded predicate arities and implications
Annals of Mathematics and Artificial Intelligence
Compactness Properties for Stable Semantics of Logic Programs
Fundamenta Informaticae - Topics in Logic, Philosophy and Foundations of Mathematics and Computer Science. In Recognition of Professor Andrzej Grzegorczyk
Compactness Properties for Stable Semantics of Logic Programs
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
On finitely recursive programs1
Theory and Practice of Logic Programming
Credulous resolution for answer set programming
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
On finitely recursive programs
ICLP'07 Proceedings of the 23rd international conference on Logic programming
A 25-year perspective on logic programming
Tableau calculi for answer set programming
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
Compactness Properties for Stable Semantics of Logic Programs
Fundamenta Informaticae - Topics in Logic, Philosophy and Foundations of Mathematics and Computer Science. In Recognition of Professor Andrzej Grzegorczyk
Goal-directed execution of answer set programs
Proceedings of the 14th symposium on Principles and practice of declarative programming
Tableau Calculi for Logic Programs under Answer Set Semantics
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
An extension of resolution for skeptical stable model semantics is introduced. Unlike previous approaches, our calculus is not derived from credulous inference and enjoys a number of properties that are not satisfied by current nonmonotonic reasoning systems. Skeptical resolution is top down, in general, and goal directed on call-consistent programs. It does not need the given program to be instantiated before reasoning. It may compute nonground answer substitutions efficiently. It is compatible with different implementations of negation as failure. Some inferences, which depend on nonground negative goals, can be drawn without resorting to negation-as-failure; as a consequence, many goals that flounder in the standard setting have a successful skeptical derivation. The paper contains a preliminary study of some interesting derivation strategies and a sketch of a prototype implementation of the calculus.