Pages that link to "Item:Q4318872"
From MaRDI portal
The following pages link to The Stable Models of a Predicate Logic Program (Q4318872):
Displaying 20 items.
- Logic programming with infinite sets (Q812390) (← links)
- My work with Victor Marek: a mathematician looks at answer set programming (Q1028636) (← links)
- A note on the stable model semantics for logic programs (Q1127348) (← links)
- How complicated is the set of stable models of a recursive logic program? (Q1192346) (← links)
- Logic programs, well-orderings, and forward chaining (Q1295428) (← links)
- Locally determined logic programs and recursive stable models (Q1430287) (← links)
- Sequent calculi for skeptical reasoning in predicate default logic and other nonmonotonic logics (Q1776197) (← links)
- Complexity and undecidability results for logic programming (Q1924779) (← links)
- A topological characterization of the stable and minimal model classes of propositional logic programs (Q1924782) (← links)
- A connection between the Cantor-Bendixson derivative and the well-founded semantics of finite logic programs (Q1926591) (← links)
- Logic programs with stable model semantics as a constraint programming paradigm (Q1978008) (← links)
- On the existence and unicity of stable models in normal residuated logic programs (Q2887039) (← links)
- Characterizations of stable model semantics for logic programs with arbitrary constraint atoms (Q3183130) (← links)
- On the existence of stable models of non-stratified logic programs (Q3426203) (← links)
- Automata and Answer Set Programming (Q3605538) (← links)
- (Q4375823) (← links)
- On the complexity of index sets for finite predicate logic programs which allow function symbols (Q5108018) (← links)
- Index Sets for Finite Normal Predicate Logic Programs with Function Symbols (Q5283418) (← links)
- On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP (Q5504658) (← links)
- Composing Normal Programs with Function Symbols (Q5504671) (← links)
