Makale detayı · 2003
Tight logic programs
Dergi
Theory and Practice of Logic Programming- Yıl
- 2003
- Tür
- article
Veri kaynağı ayrımı
- YÖKSİS dergi adı Theory and Practice of Logic Programming
- OpenAlex OpenAlex zenginleştirmesi (özet, atıf, konular)
Özet
OpenAlex · İngilizce
This note is about the relationship between two theories of negation as failure – one based on program completion, the other based on stable models, or answer sets. François Fages showed that if a logic program satisfies a certain syntactic condition, which is now called ‘tightness,’ then its stable models can be characterized as the models of its completion. We extend the definition of tightness and Fages' theorem to programs with nested expressions in the bodies of rules, and study tight logic programs containing the definition of the transitive closure of a predicate.
Konular
Atıflar
OpenAlex cited_by_count. WoS veya Scopus atıf sayısı değildir; o kaynaklar için ayrı kolon yoktur.
136 atıf
OpenAlex cited_by_count (önbellek / veritabanı)
Yerel katalogda bu makaleye atıf yapan 9 yayın (OpenAlex referans eşleşmesi; tam dünya listesi değildir).
- Inferring Phylogenetic Trees Using Answer Set Programming 2007
- Temporal phylogenetic networks and logic programming 2006
- Rectilinear Steiner Tree Construction Using Answer Set Programming 2004
- Character-Based Cladistics and Answer Set Programming 2005
- A Formal Framework for Robot Construction Problems: A Hybrid Planning Approach 2019
- A General Framework for Stable Roommates Problems using Answer Set Programming 2020
- Temporal Phylogenetic Networks and Logic Programming 2005
- Hybrid planning for challenging construction problems: An Answer Set Programming approach 2023
- Hybrid planning for challenging construction problems: An Answer Set Programming approach 2023