Detecting decidable classes of finitely ground logic programs with function symbols

No abstract is available for this paper.

• Publication year

  2013

• Venue

  ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming

• Publication date

  2013-09-16

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1145/2505879.2505883
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Logic Program Termination Analysis Using Atom Sizes

  2015cited by this paper
• Rewriting-based Check of Chase Termination

  2015cited by this paper
• Checking Chase Termination: Cyclicity Analysis and Rewriting Techniques

  2015cited by this paper
• Chase Termination for Guarded Existential Rules

  2015cited by this paper
• Checking termination of bottom-up evaluation of logic programs with function symbols*

  2014cited by this paper
• All-Instances Termination of Chase is Undecidable

  2014cited by this paper
• Theory and Practice of Logic Programming

  2014cited by this paper
• Proving Termination of Programs Automatically with AProVE

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

  2013cited by this paper
• The Chase Procedure and its Applications in Data Exchange

  2013cited by this paper
• Acyclicity Notions for Existential Rules and Their Application to Query Answering in Ontologies

  2013cited by this paper
• Incomplete Data and Data Dependencies in Relational Databases

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

  2012influential reference
• Stratification criteria and rewriting techniques for checking chase termination

  2011cited by this paper
• Enhancing ASP by Functions: Decidable Classes and Implementation Techniques

  2010cited by this paper
• Chase termination

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

  2010cited by this paper
• On Chase Termination Beyond Stratification

  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
• Polytool: Polynomial interpretations as a basis for termination analysis of logic programs

  2009cited by this paper
• Generalized schema-mappings: from termination to tractability

  2009cited by this paper
• On finitely recursive programs1

  2009influential reference
• The Complexity of Satisfiability for Fragments of CTL and CTL*

  2008cited by this paper
• Taming the Infinite Chase: Query Answering under Expressive Relational Constraints

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

  2008cited by this paper
• The chase revisited

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

  2008influential reference
• GrinGo : A New Grounder for Answer Set Programming

  2007cited by this paper
• Implementing Prioritized Reasoning in Logic Programming

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

  2007cited by this paper
• Answer Sets for Logic Programs with Arbitrary Abstract Constraint Atoms

  2006cited by this paper
• On the Semantics of Logic Programs with Preferences

  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
• MARS: A System for Publishing XML from Mixed and Redundant Storage

  2003cited by this paper
• Data exchange: semantics and query answering

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

  2003cited by this paper
• Minimal founded semantics for disjunctive logic programs and deductive databases

  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
• Proving Existential Termination of Normal Logic Programs

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

  1994cited by this paper
• Finite representation of infinite query answers

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

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

  1991cited by this paper
• Principles of Database and Knowledge-Base Systems, Volume II

  1988cited by this paper
• On Indefinite Databases and the Closed World Assumption

  1987cited by this paper
• A Proof Procedure for Data Dependencies

  1984cited by this paper
• Inclusion dependencies and their interaction with functional dependencies

  1982cited by this paper
• The complexity of propositional linear temporal logics

  1982cited 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
• 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

• Machine Learning-Augmented Ontology-Based Data Access for Renewable Energy Data

  2024cites this paper
• Computing the Why-Provenance for Datalog Queries via SAT Solvers

  2024cites this paper
• Compliance checking on first-order knowledge with conflicting and compensatory norms: a comparison among currently available technologies

  2023cites this paper
• Efficient Mechanism to Enhance the Performance of Dynamic Graphs

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

  2020cites this paper
• Approximate Query Answering over Incomplete Data

  2020cites this paper
• Combinatorial Search

  2019cites this paper
• Well Founded Semantics for P2P Deductive Databases

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

  2018cites this paper
• Efficient Maximum Flow Maintenance on Dynamic Networks

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

  2017cites this paper
• Detecting Decidable Classes of Finitely Ground Logic Programs with Function Symbols

  2017cites this paper
• Incremental maximum flow computation on evolving networks

  2017cites this paper
• Incremental Computation of Grounded Semantics for Dynamic Abstract Argumentation Frameworks

  2016cites this paper
• Incremental Computation of Deterministic Extensions for Dynamic Argumentation Frameworks

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

  2016cites this paper
• Datalog and Logic Databases

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

  2015influential citation
• Checking Termination of Datalog with Function Symbols Through Linear Constraints

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

  2014cites this paper
• Logic programming with function symbols: Checking termination of bottom-up evaluation through program adornments

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