Record link: 
http://hdl.handle.net/20.500.12708/231308
-
Title: 
SAT Modulo Well-Founded Semantics: Extended Abstract
en
Citation: 
Eiter, T., Nießen, T., & Soldà, D. (2026, September 8). SAT Modulo Well-Founded Semantics: Extended Abstract [Conference Presentation]. 18th International Conference on Logic Programming and Non-monotonic Reasoning (LPNMR 2026), Austria. http://hdl.handle.net/20.500.12708/231308
-
Publication Type: 
Presentation - Conference Presentation
en
Language: 
English
-
Authors: 
Eiter, Thomas 
Nießen, Tobias 
Soldà, Davide 
-
Organisational Unit: 
E056-13 - Fachbereich LogiCS 
E192-03 - Forschungsbereich Knowledge Based Systems 
E192-04 - Forschungsbereich Formal Methods in Systems Engineering 
E056-17 - Fachbereich Trustworthy Autonomous Cyber-Physical Systems 
-
Date (published): 
8-Sep-2026
-
Event name: 
18th International Conference on Logic Programming and Non-monotonic Reasoning (LPNMR 2026) 
en
Event date: 
7-Sep-2026 - 11-Sep-2026
-
Event place: 
Austria
-
Keywords: 
Well-Founded Semantics; SAT; Least Fixpoint Computation
en
Abstract: 
The well-founded semantics (WFS) yields a unique three-valued model for logic programs that serves as an efficient core for skeptical reasoning, but lacks built-in mechanisms for choice and case-based reasoning, limiting its expressiveness for problems such as decision making and planning. Propositional SAT solvers excel at combinatorial problems but, unlike WFS, do not naturally support reasoning under incomplete information or encoding transitive closure properties. We present an integration of a choice operator into WFS that preserves the suitability of the semantics for scalable, partial-information reasoning, as well as an efficient solving procedure.
en
Project title: 
Logics for Computer Science Program at TU Wien: 101034440 (European Commission) 
Mosaic -- modal logics: 101007627 (European Commission) 
Training and Guiding AI Agents with Ethical Rules: ICT22-023 (WWTF Wiener Wissenschafts-, Forschu und Technologiefonds) 
-
Link (external): 
https://easychair.org/publications/preprint/Z8Mm
-
Additional information: 
This work was presented within the Recently Published Research track of the 18th International Conference on Logic Programming and Non-monotonic Reasoning (LPNMR26). The extended abstract was published as EasyChair Preprint 16031 on September 27, 2026. The actual conference paper was published and presented at the 29th International Conference on Theory and Applications of Satisfiability Testing (SAT 2026) DOI: 10.4230/LIPIcs.SAT.2026.15
-
Research Areas: 
Logic and Computation: 100%
-
Science Branch: 
1020 - Informatik: 100%
-
Appears in Collections:
Presentation

Show full item record

Page view(s)

24
checked on Oct 5, 2026

Download(s)

3
checked on Oct 5, 2026

Google ScholarTM

Check