Extending and implementing the stable model semantics
Top Cited Papers
- 22 May 2002
- journal article
- Published by Elsevier BV in Artificial Intelligence
- Vol. 138 (1-2), 181-234
- https://doi.org/10.1016/s0004-3702(02)00187-x
Abstract
No abstract availableKeywords
This publication has 48 references indexed in Scilit:
- Effective implementation of negation in database logic query languagesPublished by Springer Science and Business Media LLC ,2005
- Computing with default logicArtificial Intelligence, 1999
- A constraint-based approach to narrow search trees for satisfiabilityInformation Processing Letters, 1999
- Dynamic programming in Datalog with aggregatesIEEE Transactions on Knowledge and Data Engineering, 1999
- Lexicographic priorities in default logicArtificial Intelligence, 1998
- Fully local and efficient evaluation of alternating fixed pointsLecture Notes in Computer Science, 1998
- Look-ahead versus look-back for satisfiability problemsPublished by Springer Science and Business Media LLC ,1997
- A rational reconstruction of nonmonotonic truth maintenance systemsArtificial Intelligence, 1990
- Linear-time algorithms for testing the satisfiability of propositional horn formulaeThe Journal of Logic Programming, 1984
- Circumscription—A form of non-monotonic reasoningArtificial Intelligence, 1980