The following pages link to (Q4318616):
Displaying 18 items.
- Proving completeness of logic programs with the cut (Q511027) (← links)
- Three-valued completion for abductive logic programs (Q671511) (← links)
- Order-sorted logic programming with predicate hierarchy (Q814621) (← links)
- Unifying logic, topology and learning in parametric logic (Q817837) (← links)
- Fixpoint semantics for logic programming a survey (Q1605173) (← links)
- A representation of recursively enumerable sets through Horn formulas in higher recursion theory (Q1677584) (← links)
- Linguistic\(\leftrightarrow \)rational agents' semantics (Q1688923) (← links)
- First-order theories for pure Prolog programs with negation (Q1892097) (← links)
- Nonmonotonicity in the framework of parametric logic (Q2009771) (← links)
- A study of a generalization of a card problem (Q2485637) (← links)
- A hybrid reasoning system for terminologies and first-order clauses in knowledge bases (Q2493276) (← links)
- Connecting First-Order ASP and the Logic FO(ID) through Reducts (Q2900547) (← links)
- On Completeness of Logic Programs (Q2949713) (← links)
- On definite program answers and least Herbrand models (Q4593038) (← links)
- Correctness and Completeness of Logic Programs (Q5277919) (← links)
- New Advances in Logic-Based Probabilistic Modeling by PRISM (Q5452024) (← links)
- On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP (Q5504658) (← links)
- Minimal predicates, fixed-points, and definability (Q5718684) (← links)
