Loop-separable programs and their first-order definability
type: Item
instance of: scholarly article
title: Loop-separable programs and their first-order definability
zbMATH Open document ID: 1223.68027
author: Yong-Cai Geng
author: Sumit K. Garg
published in: Artificial Intelligence
publication date: 2011-06-17T00:00:00Z
Mathematics Subject Classification ID: 68N17
Mathematics Subject Classification ID: 68T27
Mathematics Subject Classification ID: 68T30
zbMATH DE Number: 5909466
zbMATH Keywords: answer set programming
zbMATH Keywords: first-order definability
zbMATH Keywords: knowledge representation
zbMATH Keywords: nonmonotonic reasoning
describes a project that uses: ASSAT
describes a project that uses: Smodels
MaRDI profile type: Publication
full work available at URL: j.artint.2010.12.001
OpenAlex ID: W1971924127
cites work: Datalog vs first-order logic
cites work: Computing circumscription revisited: A reduction algorithm
cites work: Modeling biological networks by action languages via answer set programming
cites work: Combining answer set programming with description logics for the semantic web
cites work: Conflict-Driven Answer Set Enumeration
cites work: A non-ground realization of the stable and well-founded semantics
cites work: Logic Programming
cites work: The DLV system for knowledge representation and reasoning
cites work: ASSAT: computing answer sets of a logic program by SAT solvers
cites work: Quantified Equilibrium Logic and Foundations for Answer Set Programs
cites work: Well-founded and stable semantics of logic programs with aggregates
cites work: Q4800171
cites work: Hypothesizing about signaling networks
cites work: The Semantics of Predicate Logic as a Programming Language
DOI: 10.1016/J.ARTINT.2010.12.001
description: scientific article; zbMATH DE number 5909466