Pages that link to "Item:Q3198867"

The following pages link to A fixpoint semantics for disjunctive logic programs (Q3198867):

Displaying 39 items.

• On reasoning about structural equality in XML: a description logic approach (Q555777) (← links)
• An efficient strategy for non-Horn deductive databases (Q753478) (← links)
• The semantics of incomplete databases as an expression of preferences (Q753482) (← links)
• Computing only minimal answers in disjunctive deductive databases (Q1040782) (← links)
• Completeness of hyper-resolution via the semantics of disjunctive logic programs (Q1041788) (← links)
• Semantics of Horn and disjunctive logic programs (Q1177928) (← links)
• Paraconsistent disjunctive deductive databases (Q1185011) (← links)
• Linear resolution for consequence finding (Q1199916) (← links)
• Relating minimal models and pre-requisite-free normal defaults (Q1205716) (← links)
• Interpreting disjunctive logic programs based on a strong sense of disjunction (Q1311401) (← links)
• A semantics for a class of non-deterministic and causal production system programs (Q1340964) (← links)
• Generalized disjunctive well-founded semantics for logic programs. (Q1354026) (← links)
• On stratified disjunctive programs (Q1356225) (← links)
• Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation (Q1363783) (← links)
• The least fixpoint transformation for disjunctive logic programs (Q1389092) (← links)
• Fixpoint semantics for logic programming a survey (Q1605173) (← links)
• Syntax and semantics of multi-adjoint normal logic programming (Q1795198) (← links)
• Weak generalized closed world assumption (Q1825049) (← links)
• SATCHMORE: SATCHMO with RElevancy (Q1891262) (← links)
• Jack Minker --- A profile (Q1924718) (← links)
• Negation as failure for disjunctive logic programming (Q1924818) (← links)
• Propositional semantics for disjunctive logic programs (Q1924819) (← links)
• Avoiding duplicate proofs with the foothold refinement (Q1924821) (← links)
• Disjunctive logic programs, answer sets, and the cut rule (Q2085572) (← links)
• Complexity results for answer set programming with bounded predicate arities and implications (Q2426101) (← links)
• (Q2767052) (← links)
• To Vladimir Lifschitz on His 65th Birthday (Q2900498) (← links)
• (Q3413498) (← links)
• An effective fixpoint semantics for linear logic programs (Q4452612) (← links)
• A Step Up in Expressiveness of Decidable Fixpoint Logics (Q4635946) (← links)
• (Q4798005) (← links)
• On logic programming interpretations of Dislog: Programming long-distance dependencies in logic (Q5096199) (← links)
• Stable classes and operator pairs for disjunctive programs (Q5101462) (← links)
• Hyper tableaux (Q5235250) (← links)
• (Q5398061) (← links)
• Logic Programming and Nonmonotonic Reasoning (Q5424885) (← links)
• Temporal disjunctive logic programming (Q5929097) (← links)
• A Survey of the Proof-Theoretic Foundations of Logic Programming (Q6063891) (← links)
• Generalized well-founded semantics for logic programs (Q6488525) (← links)