Semantics of (disjunctive) logic programs based on partial evaluation

DOI10.1016/S0743-1066(98)10030-4MaRDI QIDQ4700442zbMATH OpenFDO

Authors J. Dix, Stefan Brass

Publication date 1 November 1999

Published in The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0743-1066(98)10030-4

zbMATH Keywords

logic programming semantics

Mathematics Subject Classification ID

Logic programming (68N17) Semantics in the theory of computing (68Q55)

Recommendations

• Characterizations of the stable semantics by partial evaluation
• Characterizations of the disjunctive stable semantics by partial evaluation
• Characterizations of the disjunctive well-founded semantics: Confluent calculi and iterated GCWA
• Characterizing D-WFS: confluence and iterated GCWA

Cited in

(31)

• Partial-predicate logic in computer science
• Bottom-up evaluation of datalog with negation
• Characterizations of the disjunctive well-founded semantics: Confluent calculi and iterated GCWA
• Static semantics for normal and disjunctive logic programs
• Dealing with explicit preferences and uncertainty in answer set programming
• On syntactic forgetting under uniform equivalence
• Disjunctive logic programs, answer sets, and the cut rule
• On the limits of forgetting in answer set programming
• Partial equilibrium logic
• Partial logics with two kinds of negation as a foundation for knowledge-based reasoning
• A selective semantics for logic programs with preferences
• Preserving strong equivalence while forgetting
• Analysis of residuating logic programs
• Characterizations of the disjunctive stable semantics by partial evaluation
• Partial deduction in disjunctive logic programming
• Random logic programs: linear model
• Computing loops with at most one external support rule for disjunctive logic programs
• scientific article; zbMATH DE number 6163261 (Why is no real title available?)
• Characterizations of the stable semantics by partial evaluation
• A syntactic operator for forgetting that satisfies strong persistence
• Characterizing D-WFS: confluence and iterated GCWA
• Logic Programming
• Engineering an Incremental ASP Solver
• On the equivalence of the static and disjunctive well-founded semantics and its computation
• Closed world assumption for disjunctive reasoning
• Syntactic ASP forgetting with forks
• On the foundations of grounding in answer set programming
• Forgetting in answer set programming -- a survey
• Synthesizing strongly equivalent logic programs: Beth definability for answer set programs via Craig interpolation in first-order logic
• Strong order equivalence
• Equivalence for the G₃^-stable models semantics

This page was built for publication: Semantics of (disjunctive) logic programs based on partial evaluation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4700442)