Computable Functions in ASP: Theory and Implementation
From MaRDI portal
Publication:5504670
Recommendations
Cites work
- scientific article; zbMATH DE number 25190 (Why is no real title available?)
- scientific article; zbMATH DE number 1368933 (Why is no real title available?)
- scientific article; zbMATH DE number 1884395 (Why is no real title available?)
- scientific article; zbMATH DE number 2090537 (Why is no real title available?)
- $\mathbb{FDNC}$ : Decidable Non-monotonic Disjunctive Logic Programs with Function Symbols
- A lattice-theoretical fixpoint theorem and its applications
- Erratum to: ``Reasoning with infinite stable models
- Extending and implementing the stable model semantics
- External sources of knowledge and value invention in logic programming
- Knowledge Representation, Reasoning and Declarative Problem Solving
- Norms on terms and their use in proving universal termination of a logic program
- On Finitely Recursive Programs
- Reasoning with infinite stable models
- Termination of logic programs: the never-ending story
- The DLV system for knowledge representation and reasoning
Cited in
(30)- Domain expansion for ASP-programs with external sources
- Finitely recursive programs: decidability and bottom-up computation
- A model building framework for answer set programming with external computations
- One More Decidable Class of Finitely Ground Programs
- scientific article; zbMATH DE number 6139984 (Why is no real title available?)
- Automata and Answer Set Programming
- Disjunctive ASP with functions: decidable queries and effective computation
- Answer Set Programming: A Primer
- Towards a Type Discipline for Answer Set Programming
- Synonymous theories and knowledge representations in answer set programming
- Intelligent Instantiation and Supersafe Rules
- ASP with non-herbrand partial functions: a language and system for practical use
- Index sets for finite normal predicate logic programs with function symbols
- 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
- {\textsc{ASPeRiX}}, a first-order forward chaining approach for answer set computing
- 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
- Incremental answer set programming with overgrounding
- Weight constraint programs with evaluable functions
- The intelligent grounder of DLV
- Terminating evaluation of logic programs with finite three-valued models
- Using linear constraints for logic program termination analysis
- What is answer set programming to propositional satisfiability
- Magic Sets for the Bottom-Up Evaluation of Finitely Recursive Programs
- 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
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)
