WFS + branch and bound = stable models

Subrahmanian, V. S.; Nau, Dana; Vago, C.

doi:10.1109/69.390244

Cited by 44 publications

(7 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Propagation is more or less done similarly in all three approaches. That is, all these systems follow the strategy coined in (Subrahmanian et al 1995), namely "Answer Sets = Well-founded Semantics + Branch and Bound". smodels relies on computing well-founded semantics, whereas dlv uses Fitting's or well-founded semantics, depending on whether (in our terminology) the program's RDG contains 0-cycles or not (Calimeri et al 2001).…”

Section: Discussion and Related Workmentioning

confidence: 99%

Graphs and colorings for answer set programming

Konczak¹,

Linke²,

Schaub³

2006

Theory and Practice of Logic Programming

View full text Add to dashboard Cite

We investigate the usage of rule dependency graphs and their colorings for characterizing and computing answer sets of logic programs. This approach provides us with insights into the interplay between rules when inducing answer sets. We start with different characterizations of answer sets in terms of totally colored dependency graphs that differ in graph-theoretical aspects. We then develop a series of operational characterizations of answer sets in terms of operators on partial colorings. In analogy to the notion of a derivation in proof theory, our operational characterizations are expressed as (non-deterministically formed) sequences of colorings, turning an uncolored graph into a totally colored one. In this way, we obtain an operational framework in which different combinations of operators result in different formal properties. Among others, we identify the basic strategy employed by the noMoRe system and justify its algorithmic approach. Furthermore, we distinguish operations corresponding to Fitting's operator as well as to well-founded semantics.

show abstract

Section: Discussion and Related Workmentioning

confidence: 99%

Graphs and colorings for answer set programming

Konczak¹,

Linke²,

Schaub³

2006

Theory and Practice of Logic Programming

View full text Add to dashboard Cite

show abstract

“…In [358] W.F.S. mechanism (well-founded semantics) was introduced for constructing the logical control modules.…”

Section: Mr-issues Related To Logic Of Representationmentioning

confidence: 99%

Intelligent systems:

Meystel¹

2002

View full text Add to dashboard Cite

show abstract

“…The main advantage of ASP is its high expressiveness; unfortunately, this comes at the price of a high computational cost, which has made the implementation of efficient ASP systems a difficult task. Several efforts have been spent to this end, and, after some pioneering work [7,8], a number of modern systems are now available. The most widespread ones are DLV [9], GnT [10], and Cmodels-3 [11]; many other support various fragments of the ASP language.…”

Section: Introductionmentioning

confidence: 99%