The following pages link to (Q3975936):
Displaying 19 items.
- The alternating fixpoint of logic programs with negation (Q686646) (← links)
- Partial models and logic programming (Q1094151) (← links)
- Why not negation by fixpoint? (Q1176286) (← links)
- Complete extension of general logic programs (Q1190477) (← links)
- On the relations between stable and well-founded semantics of logic programs (Q1200977) (← links)
- Graph properties for normal logic programs (Q1208418) (← links)
- Backchain iteration: Towards a practical inference method that is simple enough to be proved terminating, sound, and complete (Q1311394) (← links)
- Bottom-up evaluation of datalog with negation (Q1333369) (← links)
- A logical semantics for depth-first Prolog with ground negation (Q1390936) (← links)
- Generalized metrics and uniquely determined logic programs. (Q1427780) (← links)
- A semantics for conditionals with default negation (Q2401876) (← links)
- The Non-Boolean Logic of Natural Language Negation (Q4282804) (← links)
- Answer Synthesis for CLP Programs with Negation (Q4340538) (← links)
- (Q4955346) (← links)
- Properties of General Semantic Operators Determined by Logic-Based Systems (Q4982061) (← links)
- A rewrite mechanism for logic programs with negation (Q5055829) (← links)
- On the strong completion of logic programs (Q5096194) (← links)
- Minimum model semantics for logic programs with negation-as-failure (Q5277727) (← links)
- On correctness of normal logic programs (Q6103020) (← links)
