On the Equivalence Between Abstract Dialectical Frameworks and Logic Programs
Autor: | Juan Acosta-Guadarrama, João Alcântara, Samy Sá |
---|---|
Rok vydání: | 2019 |
Předmět: |
FOS: Computer and information sciences
Dialectic Computer Science - Logic in Computer Science Theoretical computer science Computer Science - Artificial Intelligence Computer science 0102 computer and information sciences 02 engineering and technology 01 natural sciences Logic in Computer Science (cs.LO) Theoretical Computer Science Argumentation theory Artificial Intelligence (cs.AI) Computational Theory and Mathematics 010201 computation theory & mathematics Artificial Intelligence Hardware and Architecture 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Logic program Equivalence (formal languages) Software AND gate |
Zdroj: | Theory and Practice of Logic Programming. 19:941-956 |
ISSN: | 1475-3081 1471-0684 |
Popis: | Dialectical Frameworks (ADFs) are argumentation frameworks where each node is associated with an acceptance condition. This allows us to model different types of dependencies as supports and attacks. Previous studies provided a translation from Normal Logic Programs (NLPs) to ADFs and proved the stable models semantics for a normal logic program has an equivalent semantics to that of the corresponding ADF. However, these studies failed in identifying a semantics for ADFs equivalent to a three-valued semantics (as partial stable models and well-founded models) for NLPs. In this work, we focus on a fragment of ADFs, called Attacking Dialectical Frameworks (ADF$^+$s), and provide a translation from NLPs to ADF$^+$s robust enough to guarantee the equivalence between partial stable models, well-founded models, regular models, stable models semantics for NLPs and respectively complete models, grounded models, preferred models, stable models for ADFs. In addition, we define a new semantics for ADF$^+$s, called L-stable, and show it is equivalent to the L-stable semantics for NLPs. This paper is under consideration for acceptance in TPLP. Comment: Paper presented at the 35th International Conference on Logic Programming (ICLP 2019), Las Cruces, New Mexico, USA, 20-25 September 2019, 16 pages |
Databáze: | OpenAIRE |
Externí odkaz: |