Checking Termination of Logic Programs with Function Symbols through Linear Constraints

No abstract is available for this paper.

• Publication year

  2014

• Venue

  International Web Rule Symposium

• Publication date

  2014-08-18

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/978-3-319-09870-8_7
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Fast offline partial evaluation of logic programs

  2014cited by this paper
• Terminating Evaluation of Logic Programs with Finite Three-Valued Models

  2014cited by this paper
• Energy Consumption Analysis of Programs Based on XMOS ISA-Level Models

  2013cited by this paper
• Logic programming with function symbols: Checking termination of bottom-up evaluation through program adornments

  2013cited by this paper
• Detecting decidable classes of finitely ground logic programs with function symbols

  2013cited by this paper
• Liberal Safety for Answer Set Programs with External Sources

  2013cited by this paper
• Bounded Programs: A New Decidable Class of Logic Programs with Function Symbols

  2013cited by this paper
• Answer Set Solving in Practice

  2012cited by this paper
• On the Termination of Logic Programs with Function Symbols

  2012cited by this paper
• Logic Programming and Nonmonotonic Reasoning

  2011cited by this paper
• Well–definedness and efficient inference for probabilistic logic programming under the distribution semantics

  2011cited by this paper
• Termination of narrowing via termination of rewriting

  2010cited by this paper
• One More Decidable Class of Finitely Ground Programs

  2009cited by this paper
• On finitely recursive programs1

  2009cited by this paper
• Computable Functions in ASP: Theory and Implementation

  2008cited by this paper
• Automated termination proofs for logic programs by term rewriting

  2008cited by this paper
• Root-Labeling

  2008cited by this paper
• Quasi-terminating logic programs for ensuring the termination of partial evaluation

  2007cited by this paper
• Termination analysis of logic programs through combination of type-based norms

  2007cited by this paper
• On Finitely Recursive Programs

  2007cited by this paper
• GrinGo : A New Grounder for Answer Set Programming

  2007cited by this paper
• Matrix Interpretations for Proving Termination of Term Rewriting

  2006cited by this paper
• Testing for Termination with Monotonicity Constraints

  2005cited by this paper
• Polynomial Interpretations as a Basis for Termination Analysis of Logic Programs

  2005cited by this paper
• Logic Programming

  2004cited by this paper
• Omega-Restricted Logic Programs

  2001cited by this paper
• Reasoning with infinite stable models

  2001cited by this paper
• Termination of Logic Programs: Transformational Methods Revisited

  2001cited by this paper
• Termination of term rewriting using dependency pairs

  2000cited by this paper
• Termination proofs for logic programs with tabling

  2000cited by this paper
• Proving Existential Termination of Normal Logic Programs

  1996cited by this paper
• TERMINATION OF TERM REWRITING BY SEMANTIC LABELLING

  1995cited by this paper
• Termination of Logic Programs: The Never-Ending Story

  1994cited by this paper
• Total termination of term rewriting

  1993cited by this paper
• Algebraic Methodology and Software Technology

  1992cited by this paper
• Classical negation in logic programs and disjunctive databases

  1991cited by this paper
• Termination detection in logic programs using argument sizes (extended abstract)

  1991cited by this paper
• The Stable Model Semantics for Logic Programming

  1988cited by this paper
• Under Consideration for Publication in Theory and Practice of Logic Programming Automated Termination Analysis for Logic Programs with Cut *

  year unknowncited by this paper
• Under Consideration for Publication in Theory and Practice of Logic Programming Disjunctive Asp with Functions: Decidable Queries and Effective Computation *

  year unknowncited by this paper
• Under Consideration for Publication in Theory and Practice of Logic Programming Non-termination Analysis of Logic Programs with Integer Arithmetics

  year unknowncited by this paper

• Active Integrity Constraints with Existential Quantification

  2022cites this paper
• Probabilistic Answers over Inconsistent Knowledge Bases

  2020cites this paper
• Consistent query answering with prioritized active integrity constraints

  2020cites this paper
• Dealing with Inconsistency in Databases: An Overview

  2018cites this paper
• Explorer Leveraging Equality Generating Dependencies for Chase Termination

  2017cites this paper
• Leveraging Equality Generating Dependencies for Chase Termination

  2016cites this paper
• Introduction to the special issue on the International Web Rule Symposia 2012–2014

  2016cites this paper
• Rule Technologies: Foundations, Tools, and Applications

  2015cites this paper
• Checking Termination of Datalog with Function Symbols Through Linear Constraints

  2015cites this paper
• Binary Frontier-Guarded ASP with Function Symbols

  2015cites this paper
• Logic Program Termination Analysis Using Atom Sizes

  2015influential citation
• Datalog and Logic Databases

  2015cites this paper
• Under Consideration for Publication in Theory and Practice of Logic Programming Using Linear Constraints for Logic Program Termination Analysis

  year unknowncites this paper