Corollaries on the fixpoint completion: studying the stable semantics by means of the Clark completion

The fixpoint completion fix(P) of a normal logic program P is a program transformation such that the stable models of P are exactly the models of the Clark completion of fix(P). This is well-known and was studied by Dung and Kanchanasut (1989). The correspondence, however, goes much further: The Gelfond-Lifschitz operator of P coincides with the immediate consequence operator of fix(P), as shown by Wendt (2002), and even carries over to standard operators used for characterizing the well-founded and the Kripke-Kleene semantics. We will apply this knowledge to the study of the stable semantics, and this will allow us to almost effortlessly derive new results concerning fixed-point and metric-based semantics, and neural-symbolic integration.

• Publication year

  2004

• Venue

  arXiv.org

• Publication date

  2004-02-09

• Fields of study

  Computer Science

• Identifiers
  arXiv cs/0402013
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Neural-symbolic learning systems - foundations and applications

  2012cited by this paper
• Logic programs and connectionist networks

  2004cited by this paper
• Logic programs, iterated function systems, and recurrent radial basis function networks

  2004cited by this paper
• Loop Formulas for Disjunctive Logic Programs

  2003cited by this paper
• Generalized metrics and uniquely determined logic programs

  2003influential reference
• On Tight Logic Programs and Yet Another Translation from Normal Logic Programs to Propositional Logic

  2003cited by this paper
• Continuity of Semantic Operators in Logic Programming and Their Approximation by Artificial Neural Networks

  2003cited by this paper
• ASSAT: computing answer sets of a logic program by SAT solvers

  2002cited by this paper
• The Fixed-Point Theorems of Priess-Crampe and Ribenboim in Logic Programming

  2002cited by this paper
• Fixpoint semantics for logic programming a survey

  2002cited by this paper
• Symbolic knowledge extraction from trained neural networks: A sound approach

  2001cited by this paper
• Generalized Metrics and Topology in Logic Programming Semantics

  2001cited by this paper
• Connectionist inference models

  2001cited by this paper
• Ultrametric Spaces and Logic Programming

  2000cited by this paper
• A New Fixed-Point Theorem for Logic Programming Semantics

  2000cited by this paper
• Acceptable Programs Revisited

  1999cited by this paper
• Approximating the Semantics of Logic Programs by Recurrent Neural Networks

  1999cited by this paper
• Advances in SHRUTI—A Neurally Motivated Model of Relational Knowledge Representation and Rapid Inference Using Temporal Synchrony

  1999cited by this paper
• The Connectionist Inductive Learning and Logic Programming System

  1999cited by this paper
• Some Issues Concerning Fixed-Points in Computational Logic: Quasi-Metrics, Multivalued Mappings and the Knaster-Tarski Theorem

  1999cited by this paper
• Topology and Iterates in Computational Logic

  1997cited by this paper
• QUASI-METRICS AND THE SEMANTICS OF LOGIC PROGRAMS

  1997cited by this paper
• A continuum of discrete systems

  1997cited by this paper
• Transformation-based bottom-up computation of the well-founded model

  1996cited by this paper
• TOPOLOGY AND THE SEMANTICS OF LOGIC PROGRAMS

  1995influential reference
• Towards a New Massively Parallel Computational Model for Logic Programming

  1994cited by this paper
• Metric Methods Three Examples and a Theorem

  1994cited by this paper
• Knowledge-Based Artificial Neural Networks

  1994cited by this paper
• A Universal Domain

  1994cited by this paper
• Automated Inferencing and Connectionist Models

  1993cited by this paper
• Propositional Non-Monotonic Reasoning and Inconsistency in Symmetric Neural Networks

  1991cited by this paper
• Acyclic logic programs and the completeness of SLDNF-resolution

  1991cited by this paper
• The well-founded semantics for general logic programs

  1991cited by this paper
• A Simple Fixed Point Characterization of Three-Valued Stable Model Semantics

  1991cited by this paper
• Recursive Distributed Representations

  1990cited by this paper
• Connectionist Inference Systems

  1990cited by this paper
• A logical calculus of the ideas immanent in nervous activity

  1990cited by this paper
• Negation in Logic Programming: A Formalization in Constructive Logic

  1990cited by this paper
• A Fixpoint Approach to Declarative Semantics of Logic Programs

  1989cited by this paper
• Multilayer feedforward networks are universal approximators

  1989cited by this paper
• The Query Topology in Logic Programming

  1989cited by this paper
• On the approximate realization of continuous mappings by neural networks

  1989influential reference
• On the Declarative Semantics of Deductive Databases and Logic Programs

  1988cited by this paper
• Equivalences of Logic Programs

  1988cited by this paper
• Towards a Theory of Declarative Knowledge

  1988cited by this paper
• Warren McCulloch and Walter Pitts: A Logical Calculus of the Ideas Immanent in Nervous Activity

  1986cited by this paper
• Foundations of Logic Programming

  1984cited by this paper
• Tω as a Universal Domain

  1978cited by this paper

• Extracting reduced logic programs from artificial neural networks

  2010cites this paper
• Neural-symbolic integration

  2009cites this paper
• On the Integration of Connectionist and Logic-Based Systems

  2006cites this paper
• Dimensions of Neural-symbolic Integration - A Structured Survey

  2005influential citation
• The Integration of Connectionism and First-Order Knowledge Representation and Reasoning as a Challenge for Artificial Intelligence

  2004cites this paper