Computable Functions in ASP: Theory and Implementation

DOI10.1007/978-3-540-89982-2_37zbMath1185.68150OpenAlexW1484110122MaRDI QIDQ5504670

Susanna Cozza, Giovambattista Ianni, Nicola Leone, Francesco Calimeri

Publication date: 22 January 2009

Published in: Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-89982-2_37

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (23)

Index Sets for Finite Normal Predicate Logic Programs with Function Symbols ⋮ The Intelligent Grounder of DLV ⋮ Bringing existential variables in answer set programming and bringing non-monotony in existential rules: two sides of the same coin ⋮ One More Decidable Class of Finitely Ground Programs ⋮ Terminating Evaluation of Logic Programs with Finite Three-Valued Models ⋮ Checking termination of bottom-up evaluation of logic programs with function symbols ⋮ Using linear constraints for logic program termination analysis ⋮ A model building framework for answer set programming with external computations ⋮ ASPeRiX, a first-order forward chaining approach for answer set computing ⋮ Constraint answer set solver EZCSP and why integration schemas matter ⋮ On relation between constraint answer set programming and satisfiability modulo theories ⋮ Incremental Answer Set Programming with Overgrounding ⋮ Synonymous theories and knowledge representations in answer set programming ⋮ Answer-set programs for reasoning about counterfactual interventions and responsibility scores for classification ⋮ Score-based explanations in data management and machine learning: an answer-set programming approach to counterfactual analysis ⋮ What is answer set programming to propositional satisfiability ⋮ Weight constraint programs with evaluable functions ⋮ Intelligent Instantiation and Supersafe Rules ⋮ Incremental maintenance of overgrounded logic programs with tailored simplifications ⋮ Pruning external minimality checking for answer set programs using semantic dependencies ⋮ Towards a Type Discipline for Answer Set Programming ⋮ Answer Set Programming: A Primer ⋮ Domain expansion for ASP-programs with external sources

Uses Software

• DLV-Complex
• DLV-EX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reasoning with infinite stable models
• Norms on terms and their use in proving universal termination of a logic program
• Extending and implementing the stable model semantics
• Erratum to: ``Reasoning with infinite stable models
• External sources of knowledge and value invention in logic programming
• A lattice-theoretical fixpoint theorem and its applications
• $\mathbb{FDNC}$ : Decidable Non-monotonic Disjunctive Logic Programs with Function Symbols
• On Finitely Recursive Programs
• Termination of logic programs: the never-ending story
• Knowledge Representation, Reasoning and Declarative Problem Solving
• The DLV system for knowledge representation and reasoning

This page was built for publication: Computable Functions in ASP: Theory and Implementation