Pages that link to "Item:Q3992225"

The following pages link to A procedural semantics for well-founded negation in logic programs (Q3992225):

Displaying 31 items.

• Bottom-up evaluation and query optimization of well-founded models (Q673130) (← links)
• The alternating fixpoint of logic programs with negation (Q686646) (← links)
• Enhancing global SLS-resolution with loop cutting and tabling mechanisms (Q703484) (← links)
• Making assumptions in the automated derivation (Q707362) (← links)
• Negation in rule-based database languages: A survey (Q753476) (← links)
• A note on the stable model semantics for logic programs (Q1127348) (← links)
• Transforming normal logic programs to constraint logic programs (Q1200979) (← links)
• Bottom-up evaluation of datalog with negation (Q1333369) (← links)
• A three-valued semantics for deductive databases and logic programs (Q1337468) (← links)
• Formalizing a logic for logic programming (Q1354044) (← links)
• A logical semantics for depth-first Prolog with ground negation (Q1390936) (← links)
• Logic programming and knowledge representation---The A-Prolog perspective (Q1603731) (← links)
• On the declarative and procedural semantics of logic programs (Q1823724) (← links)
• A logic programming system for nonmonotonic reasoning (Q1891266) (← links)
• Well-founded and stationary models of logic programs (Q1924748) (← links)
• On dual programs in co-logic programming and the Horn \({\mu}\)-calculus (Q2628297) (← links)
• From here to there: Stable negation in logic programming (Q2715522) (← links)
• Specialization of antecedent negation loop-rule for a fragment of propositional intuitionistic logic sequent calculus (Q2809674) (← links)
• Short note: procedural semantics and negative information of elementary formal system (Q3992228) (← links)
• A goal-oriented approach to computing the well-founded semantics (Q4275261) (← links)
• An abstract machine for fixed-order dynamically stratified programs (Q4647532) (← links)
• (Q4955338) (← links)
• A rewrite mechanism for logic programs with negation (Q5055829) (← links)
• On the strong completion of logic programs (Q5096194) (← links)
• Eliminating negation from normal logic programs (Q5096198) (← links)
• Characterizing D-WFS: Confluence and iterated GCWA (Q5236439) (← links)
• Logics in Artificial Intelligence (Q5394153) (← links)
• (Q5480638) (← links)
• The limits of fixed-order computation (Q5940930) (← links)
• A sound and complete procedure for a general logic program in non-floundering derivations with respect to the 3-valued stable model semantics (Q5958767) (← links)
• Prolegomena to logic programming for non-monotonic reasoning (Q6623791) (← links)