Bounded Programs: A New Decidable Class of Logic Programs with Function Symbols

No abstract is available for this paper.

• Publication year

  2013

• Venue

  International Joint Conference on Artificial Intelligence

• Publication date

  2013-08-03

• Fields of study

  Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Artificial Intelligence in Medicine: 23rd International Conference, AIME 2025, Pavia, Italy, June 23–26, 2025, Proceedings, Part I

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

  2012cited by this paper
• Two conditions for reducing the maximal length of node-disjoint paths in hypercubes

  2012cited by this paper
• Logic Programming and Nonmonotonic Reasoning

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

  2010cited by this paper
• On finitely recursive programs1

  2009cited by this paper
• The Dependency Triple Framework for Termination of Logic Programs

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

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

  2008cited by this paper
• Root-Labeling

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

  2008influential reference
• Termination analysis of logic programs through combination of type-based norms

  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
• Polynomial Interpretations as a Basis for Termination Analysis of Logic Programs

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

  2005cited by this paper
• Under Consideration for Publication in Theory and Practice of Logic Programming on Termination of Meta-programs

  2003cited by this paper
• Reasoning with infinite stable models

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

  2001cited by this paper
• Omega-Restricted Logic Programs

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

  2000cited by this paper
• Algebraic Methodology and Software Technology

  1999cited by this paper
• Logic Programming And Nonmonotonic Reasoning

  1997cited 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
• Guest editor's introduction to the special section on the third international conference on computer languages

  1992cited by this paper
• Rewriting Techniques and Applications

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

  1991cited by this paper
• Journal of automated reasoning

  1986cited by this paper
• Under consideration for publication in Theory and Practice of Logic Programming 1 Characterizations of Stable Model Semantics for Logic Programs with Arbitrary Constraint Atoms

  year unknowncited 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 Non-termination Analysis of Logic Programs with Integer Arithmetics

  year unknowncited by this paper

• Polynomial and Exponential Bounded Logic Programs with Function Symbols: Some New Decidable Classes

  2019influential citation
• A survey of probabilistic logic programming

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

  2017cites this paper
• Polynomially Bounded Logic Programs with Function Symbols: A New Decidable

  2017influential citation
• Extending Answer Set Programs with Interpreted Functions as First-Class Citizens

  2017cites this paper
• Domain expansion for ASP-programs with external sources

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

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

  2015cites this paper
• Datalog and Logic Databases

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

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

  2015influential citation
• Rule Technologies: Foundations, Tools, and Applications

  2015cites this paper
• Checking Termination of Logic Programs with Function Symbols through Linear Constraints

  2014cites this paper
• Probabilistic Logic Programming Under the Distribution Semantics

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

  2014influential citation
• Logic programming with function symbols: Checking termination of bottom-up evaluation through program adornments

  2013cites this paper
• Towards decidable classes of logic programs with function symbols

  2013cites this paper
• Answer Set Programming with External Sources

  2012cites 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