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

Lower Bound Founded Logic of Here-and-There

  • A distinguishing feature of Answer Set Programming is that all atoms belonging to a stable model must be founded. That is, an atom must not only be true but provably true. This can be made precise by means of the constructive logic of Here-and-There, whose equilibrium models correspond to stable models. One way of looking at foundedness is to regard Boolean truth values as ordered by letting true be greater than false. Then, each Boolean variable takes the smallest truth value that can be proven for it. This idea was generalized by Aziz to ordered domains and applied to constraint satisfaction problems. As before, the idea is that a, say integer, variable gets only assigned to the smallest integer that can be justified. In this paper, we present a logical reconstruction of Aziz’ idea in the setting of the logic of Here-and-There. More precisely, we start by defining the logic of Here-and-There with lower bound founded variables along with its equilibrium models and elaborate upon its formal properties. Finally, we compare our approachA distinguishing feature of Answer Set Programming is that all atoms belonging to a stable model must be founded. That is, an atom must not only be true but provably true. This can be made precise by means of the constructive logic of Here-and-There, whose equilibrium models correspond to stable models. One way of looking at foundedness is to regard Boolean truth values as ordered by letting true be greater than false. Then, each Boolean variable takes the smallest truth value that can be proven for it. This idea was generalized by Aziz to ordered domains and applied to constraint satisfaction problems. As before, the idea is that a, say integer, variable gets only assigned to the smallest integer that can be justified. In this paper, we present a logical reconstruction of Aziz’ idea in the setting of the logic of Here-and-There. More precisely, we start by defining the logic of Here-and-There with lower bound founded variables along with its equilibrium models and elaborate upon its formal properties. Finally, we compare our approach with related ones and sketch future work.show moreshow less

Export metadata

Additional Services

Search Google Scholar Statistics
Metadaten
Author details:Pedro CabalarORCiDGND, Jorge FandinnoORCiD, Torsten H. SchaubORCiDGND, Sebastian SchellhornORCiD
DOI:https://doi.org/10.1007/978-3-030-19570-0_34
ISBN:978-3-030-19570-0
ISBN:978-3-030-19569-4
ISSN:0302-9743
ISSN:1611-3349
Title of parent work (English):Logics in Artificial Intelligence
Publisher:Springer
Place of publishing:Cham
Publication type:Other
Language:English
Date of first publication:2019/05/06
Publication year:2019
Release date:2021/05/03
Volume:11468
Number of pages:17
First page:509
Last Page:525
Organizational units:Mathematisch-Naturwissenschaftliche Fakultät / Institut für Informatik und Computational Science
DDC classification:0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 000 Informatik, Informationswissenschaft, allgemeine Werke
Accept ✔
This website uses technically necessary session cookies. By continuing to use the website, you agree to this. You can find our privacy policy here.