Transformations between signed and classical clause logic

Beckert, Bernhard; Hähnle, Reiner; Manyà, Felip

doi:10.1109/ismvl.1999.779724

Cited by 24 publications

(30 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The extension of our theoretical results to weighted clauses is straightforward. We plan to investigate other encodings from WCSP to Signed Max-SAT and investigate their complexity in the style of the satisfiability preserving encodings defined in [5,2].…”

Section: Encoding Wcsp Into Signed Max-satmentioning

confidence: 99%

A Complete Resolution Calculus for Signed Max-SAT

Ansótegui

Bonet

Levy³

et al. 2007

37th International Symposium on Multiple-Valued Logic (ISMVL'07)

View full text Add to dashboard Cite

show abstract

Section: Encoding Wcsp Into Signed Max-satmentioning

confidence: 99%

A Complete Resolution Calculus for Signed Max-SAT

Ansótegui

Bonet

Levy³

et al. 2007

37th International Symposium on Multiple-Valued Logic (ISMVL'07)

View full text Add to dashboard Cite

show abstract

“…In [5], translations between signed logic and FOL are investigated. Annotated logic [26] can be embedded in signed logic.…”

Section: Related Workmentioning

confidence: 99%

“…The two rules of regular unit resolution for signed logic correspond exactly to the inference rules of constraint annotated logics. In [5], the lattice structure is encoded by giving FOL clauses for each pair of lattice elements (i.e., labels). This is only feasible for finite lattices.…”

Section: Related Workmentioning

confidence: 99%

Semantics for Temporal Annotated Constraint Logic Programming

Raffaetà

Frühwirth

2000

Applied Logic Series

View full text Add to dashboard Cite

We investigate semantics of a considerable subset of Temporal Annotated Constraint Logic Programming (TACLP), a class of languages that allows us to reason about qualitative and quantitative, definite and indefinite temporal information using time points and time periods as labels for atoms. After illustrating the power of TACLP with some non-trivial examples, TACLP is given two different kinds of semantics, an operational one based on meta-logic (top-down semantics) and, for the first time, a fixpoint one based on an immediate consequence operator (bottom-up semantics). We prove the top-down semantics to be sound and complete with respect to the bottom-up semantics.

show abstract

“…This work is part of a research program about manyvalued satisfiability we have carried out during the last decade [3,7,8,9,10,11,19,4,5,6]). Our aim is bridging the gap between Boolean SAT/MaxSAT encodings and constraint satisfaction formalisms.…”

Section: Introductionmentioning

confidence: 99%