Domain expansion for ASP-programs with external sources

DOI10.1016/J.ARTINT.2016.01.003zbMATH Open1351.68265DBLPjournals/ai/EiterFKR16OpenAlexW2272418519WikidataQ57549074 ScholiaQ57549074MaRDI QIDQ254002FDOQ254002

Authors: Thomas Eiter, Michael Fink, Thomas Krennwallner, Christoph Redl 

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

Recommendations

• Answer set programming with external sources
• Conflict-driven ASP solving with external sources
• Logic Programming and Nonmonotonic Reasoning
• Answer set programming with external source access
• Exploiting partial assignments for efficient evaluation of answer set programs with external source access

zbMATH Keywords

answer set programmingcomputational logicexternal source accessgroundingknowledge representation formalismsnonmonotonic reasoning

Mathematics Subject Classification ID

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

Cites Work

• External sources of knowledge and value invention in logic programming
• Title not available (Why is that?)
• 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
• 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
• Title not available (Why is that?)
• Constraint Answer Set Solving
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• Semantics and complexity of recursive aggregates in answer set programming
• Title not available (Why is that?)
• Computable Functions in ASP: Theory and Implementation
• Safe Formulas in the General Theory of Stable Models (Preliminary Report)
• The termination hierarchy for term rewriting
• Reasoning with infinite stable models

Cited In (9)

• The<scp>dlvhex</scp>system for knowledge representation: recent advances (system description)
• External sources of knowledge and value invention in logic programming
• LARS: a logic-based framework for analytic reasoning over streams
• Inlining external sources in answer set programs
• Title not available (Why is that?)
• Pruning external minimality checking for answer set programs using semantic dependencies
• Exploiting answer set programming with external sources for meta-interpretive learning
• 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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q254002)