Domain expansion for ASP-programs with external sources
type: Item
instance of: scholarly article
title: Domain expansion for ASP-programs with external sources
zbMATH Open document ID: 1351.68265
author: Thomas Eiter
author: Michael Fink
author: Thomas Krennwallner
author: Christoph Redl
published in: Artificial Intelligence
publication date: 2016-03-08T00:00:00Z
Mathematics Subject Classification ID: 68T27
Mathematics Subject Classification ID: 68N17
Mathematics Subject Classification ID: 68T30
zbMATH DE Number: 6551562
zbMATH Keywords: answer set programming
zbMATH Keywords: knowledge representation formalisms
zbMATH Keywords: nonmonotonic reasoning
zbMATH Keywords: external source access
zbMATH Keywords: grounding
zbMATH Keywords: computational logic
describes a project that uses: Potassco
describes a project that uses: Gringo
describes a project that uses: DLV-EX
describes a project that uses: Clingcon
MaRDI profile type: Publication
full work available at URL: j.artint.2016.01.003
OpenAlex ID: W2272418519
Wikidata QID: Q57549074
cites work: Disjunctive datalog with existential quantifiers: Semantics, decidability, and complexity issues
cites work: Q5503674
cites work: Q4812969
cites work: Reasoning with infinite stable models
cites work: A Revised Concept of Safety for General Answer Set Programs
cites work: External sources of knowledge and value invention in logic programming
cites work: Computable Functions in ASP: Theory and Implementation
cites work: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
cites work: The computational complexity of ideal semantics
cites work: Pushing Efficient Evaluation of HEX Programs by Modular Decomposition
cites work: Conflict-driven ASP solving with external sources
cites work: Efficient HEX-Program Evaluation Based on Unfounded Sets
cites work: Combining answer set programming with description logics for the semantic web
cites work: Semantics and complexity of recursive aggregates in answer set programming
cites work: Q3011296
cites work: Constraint Answer Set Solving
cites work: Q3983043
cites work: Acyclicity notions for existential rules and their application to query answering in ontologies
cites work: On the Termination of Logic Programs with Function Symbols
cites work: A framework for testing safety and effective computability
cites work: Safe Formulas in the General Theory of Stable Models (Preliminary Report)
cites work: The DLV system for knowledge representation and reasoning
cites work: One More Decidable Class of Finitely Ground Programs
cites work: Logic Programming and Nonmonotonic Reasoning
cites work: Extending and implementing the stable model semantics
cites work: Q4798015
cites work: Termination of term rewriting: Interpretation and type elimination
cites work: The termination hierarchy for term rewriting
DBLP publication ID: journals/ai/EiterFKR16
DOI: 10.1016/J.ARTINT.2016.01.003
description: scientific article; zbMATH DE number 6551562