Propositional semantics for disjunctive logic programs
- 1 March 1994
- journal article
- Published by Springer Nature in Annals of Mathematics and Artificial Intelligence
- Vol. 12 (1-2) , 53-87
- https://doi.org/10.1007/bf01530761
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Classical negation in logic programs and disjunctive databasesNew Generation Computing, 1991
- Hard problems for simple default logicsArtificial Intelligence, 1991
- A fixpoint semantics for disjunctive logic programsThe Journal of Logic Programming, 1990
- A rational reconstruction of nonmonotonic truth maintenance systemsArtificial Intelligence, 1990
- Enhancement schemes for constraint processing: Backjumping, learning, and cutset decompositionArtificial Intelligence, 1990
- Tree clustering for constraint networksArtificial Intelligence, 1989
- Towards a Theory of Declarative KnowledgePublished by Elsevier ,1988
- Network-based heuristics for constraint-satisfaction problemsArtificial Intelligence, 1987
- Complexity of Finding Embeddings in a k-TreeSIAM Journal on Algebraic Discrete Methods, 1987
- A sufficient condition for backtrack-bounded searchJournal of the ACM, 1985