Recommendations
Cites work
- Answer set programming based on propositional satisfiability
- Automatic Structures: Richness and Limitations
- Extending and implementing the stable model semantics
- scientific article; zbMATH DE number 1696830 (Why is no real title available?)
- scientific article; zbMATH DE number 4147557 (Why is no real title available?)
- scientific article; zbMATH DE number 478394 (Why is no real title available?)
- scientific article; zbMATH DE number 1368933 (Why is no real title available?)
- scientific article; zbMATH DE number 3274715 (Why is no real title available?)
- Knowledge Representation, Reasoning and Declarative Problem Solving
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- Logic programming and knowledge representation---The A-Prolog perspective
- Logic programs with stable model semantics as a constraint programming paradigm
- Minimal belief and negation as failure
- Set based logic programming
- The DLV system for knowledge representation and reasoning
- The expressiveness of locally stratified programs
- The Stable Models of a Predicate Logic Program
Cited in
(3)
This page was built for publication: Automata and Answer Set Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3605538)