2026· International Conference on Theory and Applications of Satisfiability Testing· pp. 15:1-15:22· 0 citations· 61 references
Computer Science
TL;DR
It is shown that the choice operator can be materialized by a SAT solver while propagating the consequences of choices through an extension of the alternating fixpoint algorithm for WFS with conflicts that are propagated back to the SAT solver.
This work presents a new semantics which evaluates ontological atoms more strictly than the current semantics, which keeps the complexity of its consistency problem NP-complete, rather than increasing it to the second level of the polynomial hierarchy.
Spencer Killen, Jia-Huai You· Electronic Proceedings in Th...· 0 citations
A conservative extension of relational cover semantics is presented that alleviates a restriction that restricts the class of models and complicates model construction and is amenable to simpler and standard model construction techniques.
A translation from K formulae to closed QBF formulae that maps a satisfiable formula to a true one, with an optimisation to close the gap in understanding of how the polynomial hierarchy relates to modal logic - and consequently concept satisfiability in 𝒜ℒ𝒞 .
M. Hassan, U. Sattler· Digital library· 0 citations
A many-sorted variant of the Bound-founded Logic of Here-and-There (HTb) is introduced, providing a versatile framework capable of characterizing equilibrium models across a wide spectrum of alternative semantics for extensions of ASP with linear constraints.
Pedro Cabalar, Jorge Fandinno, N. Rühling et al.· Electronic Proceedings in Th...· 0 citations
This work proposes to consider the three refined GAS principles as alternative principles for answer set semantics in general and for answer set and world view construction in particular and analyzes the computational complexity of well-supportedness and the rational answer set and world view semantics.
Yi-Dong Shen, Thomas Eiter· ACM Transactions on Computat...· 0 citations
This work constructs paired modal problems with identical premises and conjecture but different frame or domain conditions; automated reasoning verifies opposite labels and releases the formulas, oracle artifacts, countermodels, and responses.
R. Andrieu, Damien Sileo· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
