Computable Functions in ASP: Theory and Implementation
From MaRDI portal
Publication:5504670
DOI10.1007/978-3-540-89982-2_37zbMATH Open1185.68150OpenAlexW1484110122MaRDI QIDQ5504670
Susanna Cozza, Giovambattista Ianni, N. 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
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- External sources of knowledge and value invention in logic programming
- Extending and implementing the stable model semantics
- Knowledge Representation, Reasoning and Declarative Problem Solving
- The DLV system for knowledge representation and reasoning
- Reasoning with infinite stable models
- 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
- Norms on terms and their use in proving universal termination of a logic program
- Erratum to: ``Reasoning with infinite stable models
Cited In (26)
- The Intelligent Grounder of DLV
- Domain expansion for ASP-programs with external sources
- A model building framework for answer set programming with external computations
- Terminating Evaluation of Logic Programs with Finite Three-Valued Models
- One More Decidable Class of Finitely Ground Programs
- Title not available (Why is that?)
- Answer Set Programming: A Primer
- Towards a Type Discipline for Answer Set Programming
- Intelligent Instantiation and Supersafe Rules
- Incremental Answer Set Programming with Overgrounding
- Synonymous theories and knowledge representations in answer set programming
- ASP with non-herbrand partial functions: a language and system for practical use
- Logic programming
- Incremental maintenance of overgrounded logic programs with tailored simplifications
- On relation between constraint answer set programming and satisfiability modulo theories
- Checking termination of bottom-up evaluation of logic programs with function symbols
- Bringing existential variables in answer set programming and bringing non-monotony in existential rules: two sides of the same coin
- Constraint answer set solver EZCSP and why integration schemas matter
- Pruning external minimality checking for answer set programs using semantic dependencies
- Weight constraint programs with evaluable functions
- Using linear constraints for logic program termination analysis
- What is answer set programming to propositional satisfiability
- 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
- Index Sets for Finite Normal Predicate Logic Programs with Function Symbols
- ASPeRiX, a first-order forward chaining approach for answer set computing
Uses Software
This page was built for publication: Computable Functions in ASP: Theory and Implementation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5504670)
