Domain expansion for ASP-programs with external sources

DOI10.1016/j.artint.2016.01.003zbMath1351.68265OpenAlexW2272418519WikidataQ57549074 ScholiaQ57549074MaRDI QIDQ254002

Michael Fink, Christoph Redl, Thomas Eiter, Thomas Krennwallner

Publication date: 8 March 2016

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2016.01.003

zbMATH Keywords

nonmonotonic reasoningcomputational logicanswer set programmingexternal source accessgroundingknowledge representation formalisms

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Knowledge representation (68T30) Logic programming (68N17)

Related Items (7)

LARS: a logic-based framework for analytic reasoning over streams ⋮ Exploiting Answer Set Programming with External Sources for Meta-Interpretive Learning ⋮ The<scp>dlvhex</scp>system for knowledge representation: recent advances (system description) ⋮ Inlining External Sources in Answer Set Programs ⋮ Pruning external minimality checking for answer set programs using semantic dependencies ⋮ Answers set programs for non-transferable utility games: expressiveness, complexity and applications ⋮ Rule-based Stream Reasoning for Intelligent Administration of Content-Centric Networks

Uses Software

• Gringo
• DLV-EX
• Potassco
• Clingcon

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Semantics and complexity of recursive aggregates in answer set programming
• Reasoning with infinite stable models
• The computational complexity of ideal semantics
• Termination of term rewriting: Interpretation and type elimination
• Extending and implementing the stable model semantics
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
• A framework for testing safety and effective computability
• Combining answer set programming with description logics for the semantic web
• External sources of knowledge and value invention in logic programming
• Acyclicity Notions for Existential Rules and Their Application to Query Answering in Ontologies
• Pushing Efficient Evaluation of HEX Programs by Modular Decomposition
• A Revised Concept of Safety for General Answer Set Programs
• Constraint Answer Set Solving
• Conflict-driven ASP solving with external sources
• Disjunctive datalog with existential quantifiers: Semantics, decidability, and complexity issues
• The DLV system for knowledge representation and reasoning
• One More Decidable Class of Finitely Ground Programs
• On the Termination of Logic Programs with Function Symbols
• Efficient HEX-Program Evaluation Based on Unfounded Sets
• Logic Programming and Nonmonotonic Reasoning
• Computable Functions in ASP: Theory and Implementation
• Safe Formulas in the General Theory of Stable Models (Preliminary Report)
• The termination hierarchy for term rewriting

This page was built for publication: Domain expansion for ASP-programs with external sources