Definitions in Answer Set Programming

Erdoğan, Selim T.; Lifschitz, Vladimir

doi:10.1007/978-3-540-24599-5_34

Cited by 19 publications

(52 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The following definitions are needed for stating the splitting set theorem of [14]. A splitting set for a program is any set U of atoms such that, for every rule r ∈ , if the head contains any atoms from U, then all of the atoms in r are in U.…”

Section: Proposition 2 Of [14] For Any Program and Formula F A Set Xmentioning

confidence: 99%

“…Let 1 be the program consisting of rules (9)- (14). The following proposition shows that the answer sets for 1 describe ordered binary trees.…”

Section: Correctness Properties Of the Programmentioning

confidence: 99%

“…The proofs of Propositions 3 and 4 and the correctness theorem are based on the splitting set theorem and use the method proposed in [14]. They are presented in the Appendix.…”

Section: Proposition 4 a Phylogeny (V E L I S F ) Has At Most N mentioning

confidence: 99%

“…(Hakka, (Min, (Yue, ((Xiang, Gan), (Wu, Mandarin))))) 3 13 (Gan, ((Xiang, (Wu, Mandarin)), (Yue, (Hakka, Min)))) 2 14 (Wu, ((Xiang, Gan), (Mandarin, (Yue, (Hakka, Min))))) 3 *15 ((Hakka, Min), (Yue, (Gan, (Xiang, (Wu, Mandarin))))) 2 16…”

Section: Computing Phylogenetic Trees For Chinese Dialectsmentioning

confidence: 99%

See 3 more Smart Citations

Inferring Phylogenetic Trees Using Answer Set Programming

et al. 2007

Self Cite

View full text Add to dashboard Cite

We describe the reconstruction of a phylogeny for a set of taxa, with a character-based cladistics approach, in a declarative knowledge representation formalism, and show how to use computational methods of answer set programming to generate conjectures about the evolution of the given taxa. We have applied this computational method in two domains: historical analysis of languages and historical analysis of parasite-host systems. In particular, using this method, we have computed some plausible phylogenies for Chinese dialects, for Indo-European language groups, and for Alcataenia species. Some of these plausible phylogenies are different from the ones computed by other software. Using this method, we can easily describe domain-specific information (e.g., temporal and geographical constraints), and thus prevent the reconstruction of some phylogenies that are not plausible.

show abstract

Section: Proposition 2 Of [14] For Any Program and Formula F A Set Xmentioning

confidence: 99%

“…Let 1 be the program consisting of rules (9)- (14). The following proposition shows that the answer sets for 1 describe ordered binary trees.…”

Section: Correctness Properties Of the Programmentioning

confidence: 99%

“…The proofs of Propositions 3 and 4 and the correctness theorem are based on the splitting set theorem and use the method proposed in [14]. They are presented in the Appendix.…”

Section: Proposition 4 a Phylogeny (V E L I S F ) Has At Most N mentioning

confidence: 99%

Section: Computing Phylogenetic Trees For Chinese Dialectsmentioning

confidence: 99%

See 2 more Smart Citations

Inferring Phylogenetic Trees Using Answer Set Programming

et al. 2007

Self Cite

View full text Add to dashboard Cite

show abstract

“…Secondly, in Section 9 we extend the technique of Janhunen et al [16] that uses program transformations to reduce the computation of p-stable models for disjunctive programs to that of stable models; we show that this method can be extended to reduce PEL to equilibrium logic. Lastly, in Section 10, we consider the method of splitting a logic program, a familiar technique for optimising computation under the stable model semantics [14,18]. We derive a splitting theorem for disjunctive and nested logic programs under PEL.…”

Section: Introductionmentioning

confidence: 99%

Partial equilibrium logic

Cabalar

Odintsov

Pearce

et al. 2007

Ann Math Artif Intell

View full text Add to dashboard Cite

Partial equilibrium logic (PEL) is a new nonmonotonic reasoning formalism closely aligned with logic programming under well-founded and partial stable model semantics. In particular it provides a logical foundation for these semantics as well as an extension of the basic syntax of logic programs. In this paper we describe PEL, study some of its logical properties and examine its behaviour on disjunctive and nested logic programs. In addition we consider computational features of PEL and study different approaches to its computation.

show abstract

Strong Equivalence and Program’s Structure in Arguing Essential Equivalence Between First-Order Logic Programs

Lierler

2018

Practical Aspects of Declarative Languages

View full text Add to dashboard Cite

Answer set programming is a prominent declarative programming paradigm used in formulating combinatorial search problems and implementing distinct knowledge representation formalisms. It is common that several related and yet substantially different answer set programs exist for a given problem. Sometimes these encodings may display significantly different performance. Uncovering precise formal links between these programs is often important and yet far from trivial. This paper claims the correctness of a number of interesting program rewritings. It also provides the proof of correctness of recent system PROJECTOR concerned with automatic program rewritings for the sake of efficiency.

show abstract

Definitions in Answer Set Programming

Cited by 19 publications

References 1 publication

Inferring Phylogenetic Trees Using Answer Set Programming

Inferring Phylogenetic Trees Using Answer Set Programming

Partial equilibrium logic

Strong Equivalence and Program’s Structure in Arguing Essential Equivalence Between First-Order Logic Programs

Contact Info

Product

Resources

About