Pages that link to "Item:Q4036289"
From MaRDI portal
The following pages link to Tight, consistent, and computable completions for unrestricted logic programs (Q4036289):
Displaying 16 items.
- A formalization of programs in first-order logic with a discrete linear order (Q274400) (← links)
- Stable models and circumscription (Q543596) (← links)
- Bottom-up evaluation and query optimization of well-founded models (Q673130) (← links)
- Strict completion of logic programs (Q751309) (← links)
- Completions of perpetual logic programs (Q1193890) (← links)
- Graph properties for normal logic programs (Q1208418) (← links)
- Applications of the situation calculus to formalizing control and strategic information: the Prolog cut operator (Q1274764) (← links)
- Uniform closures: Order-theoretically reconstructing logic program semantics and abstract domain refinements (Q1275821) (← links)
- What is failure? An approach to constructive negation (Q1346220) (← links)
- A logical semantics for depth-first Prolog with ground negation (Q1390936) (← links)
- Tight semantics for logic programs (Q2883086) (← links)
- Thirteen Definitions of a Stable Model (Q3586017) (← links)
- (Q3789061) (← links)
- The 3 Frenchmen method proves undecidability of the uniform boundedness for single recursive rule ternary DATALOG Programs (Q4593950) (← links)
- Twelve Definitions of a Stable Model (Q5504644) (← links)
- Efficient TBox Reasoning with Value Restrictions using the <i>wer</i> Reasoner (Q6063879) (← links)
