The search result changed since you submitted your search request. Documents might be displayed in a different sort order.
  • search hit 6 of 40378
Back to Result List

Dual-normal logic programs

  • Disjunctive Answer Set Programming is a powerful declarative programming paradigm with complexity beyond NP. Identifying classes of programs for which the consistency problem is in NP is of interest from the theoretical standpoint and can potentially lead to improvements in the design of answer set programming solvers. One of such classes consists of dual-normal programs, where the number of positive body atoms in proper rules is at most one. Unlike other classes of programs, dual-normal programs have received little attention so far. In this paper we study this class. We relate dual-normal programs to propositional theories and to normal programs by presenting several inter-translations. With the translation from dual-normal to normal programs at hand, we introduce the novel class of body-cycle free programs, which are in many respects dual to head-cycle free programs. We establish the expressive power of dual-normal programs in terms of SE- and UE-models, and compare them to normal programs. We also discuss the complexity ofDisjunctive Answer Set Programming is a powerful declarative programming paradigm with complexity beyond NP. Identifying classes of programs for which the consistency problem is in NP is of interest from the theoretical standpoint and can potentially lead to improvements in the design of answer set programming solvers. One of such classes consists of dual-normal programs, where the number of positive body atoms in proper rules is at most one. Unlike other classes of programs, dual-normal programs have received little attention so far. In this paper we study this class. We relate dual-normal programs to propositional theories and to normal programs by presenting several inter-translations. With the translation from dual-normal to normal programs at hand, we introduce the novel class of body-cycle free programs, which are in many respects dual to head-cycle free programs. We establish the expressive power of dual-normal programs in terms of SE- and UE-models, and compare them to normal programs. We also discuss the complexity of deciding whether dual-normal programs are strongly and uniformly equivalent.show moreshow less

Download full text files

  • SHA-1: 292ddc64e73b5ba026a899dc943cd274b2c464e5

Export metadata

Additional Services

Share in Twitter Search Google Scholar Statistics
Metadaten
Author:Johannes K. FichteORCiD, Miroslaw Truszczynski, Stefan Woltran
URN:urn:nbn:de:kobv:517-opus4-414490
DOI:https://doi.org/10.25932/publishup-41449
ISSN:1866-8372
Parent Title (English):Postprints der Universität Potsdam : Mathematisch-Naturwissenschaftliche Reihe
Subtitle (English):the forgotten class
Series (Serial Number):Postprints der Universität Potsdam : Mathematisch-Naturwissenschaftliche Reihe (585)
Document Type:Postprint
Language:English
Date of first Publication:2019/02/11
Year of Completion:2015
Publishing Institution:Universität Potsdam
Release Date:2019/02/11
Tag:answer set programming; classes of logic programs; propositional satisfiability; strong and uniform equivalence
Issue:585
Pagenumber:16
Source:Theory and Practice of Logic Programming 15 (2015) 4–5, pp. 495–510 DOI 10.1017/S1471068415000186
Organizational units:Mathematisch-Naturwissenschaftliche Fakultät
Dewey Decimal Classification:0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 004 Datenverarbeitung; Informatik
Peer Review:Referiert
Publication Way:Open Access
Grantor:Cambridge University Press (CUP)
Licence (German):License LogoKeine Nutzungslizenz vergeben - es gilt das deutsche Urheberrecht