The following pages link to (Q5750391):
Displayed 34 items.
- A necessary condition for constructive negation in constraint logic programming (Q294756) (← links)
- Semantics of structured normal logic programs (Q444364) (← links)
- Three-valued completion for abductive logic programs (Q671511) (← links)
- A logic for programming with complex objects (Q686642) (← links)
- The alternating fixpoint of logic programs with negation (Q686646) (← links)
- Enhancing global SLS-resolution with loop cutting and tabling mechanisms (Q703484) (← links)
- Programming in three-valued logic (Q753474) (← links)
- Negation in rule-based database languages: A survey (Q753476) (← links)
- Negation by default and unstratifiable logic programs (Q753501) (← links)
- Is there an axiomatic semantics for standard pure Prolog? (Q805224) (← links)
- Generalized closed world assumption is \(\Pi ^ 0_ 2\)-complete (Q910251) (← links)
- Replacing unification by constraint satisfaction to improve logic program expressiveness (Q912656) (← links)
- Inferring negative information from disjunctive databases (Q1114440) (← links)
- Between constructive mathematics and PROLOG (Q1173742) (← links)
- On the relations between stable and well-founded semantics of logic programs (Q1200977) (← links)
- Graph properties for normal logic programs (Q1208418) (← links)
- A transformation system for deductive database modules with perfect model semantics (Q1208734) (← links)
- A semantics for modular general logic programs (Q1274967) (← links)
- Soundness of abductive proof procedure with respect to constraint for non-ground abducibles (Q1274977) (← links)
- First-order syntactic characterizations of minimal entailment, domain- minimal entailment, and Herbrand entailment (Q1311412) (← links)
- A three-valued semantics for deductive databases and logic programs (Q1337468) (← links)
- An algorithm for determining database consistency under the closed world assumption (Q1337643) (← links)
- SLDNF resolution with non-safe rule and fixpoint semantics for general logic programs (Q1350529) (← links)
- A sound and complete semantics for a version of negation as failure (Q1824413) (← links)
- Weak generalized closed world assumption (Q1825049) (← links)
- Well-founded and stationary models of logic programs (Q1924748) (← links)
- Preference logics: Towards a unified approach to nonmonotonicity in deductive reasoning (Q1924777) (← links)
- Complexity and undecidability results for logic programming (Q1924779) (← links)
- HR-SQL: extending SQL with hypothetical reasoning and improved recursion for current database systems (Q2304532) (← links)
- A paraconsistent approach to actions in informationally complex environments (Q2330540) (← links)
- Nonmonotonic Trust Management for P2P Applications (Q2804936) (← links)
- Intuitionistic three-valued logic and logic programming (Q3991300) (← links)
- Constructive negation and constraint logic programming with sets (Q5945160) (← links)
- Fuzzy logic programming (Q5946475) (← links)