The following pages link to (Q3983046):
Displaying 14 items.
- Ordered completion for first-order logic programs on finite structures (Q420824) (← links)
- Generalized metrics and uniquely determined logic programs. (Q1427780) (← links)
- What is answer set programming to propositional satisfiability (Q1699519) (← links)
- A model-theoretic reconstruction of the operational semantics of logic programs (Q1803658) (← links)
- The meaning of negative premises in transition system specifications. II (Q1878713) (← links)
- Thirteen Definitions of a Stable Model (Q3586017) (← links)
- Modeling the suppression task under weak completion and well-founded semantics (Q4583344) (← links)
- Finite model reasoning over existential rules (Q4592706) (← links)
- On the Coincidence of Semantics for Uniquely Determined Programs (Q4923373) (← links)
- Stability, Supportedness, Minimality and Kleene Answer Set Programs (Q5172611) (← links)
- Twelve Definitions of a Stable Model (Q5504644) (← links)
- Generalized well-founded semantics for logic programs (Q6488525) (← links)
- Embedding justification theory in approximation fixpoint theory (Q6566637) (← links)
- Update programs versus revision programs (Q6623798) (← links)
