Sciweavers

40 search results - page 1 / 8
» The Expressive Power of Valued Constraints: Hierarchies and ...
Sort
View
CP
2007
Springer
13 years 11 months ago
The Expressive Power of Valued Constraints: Hierarchies and Collapses
Abstract. In this paper we investigate the ways in which a fixed collection of valued constraints can be combined to express other valued constraints. We show that in some cases a ...
David A. Cohen, Peter Jeavons, Stanislav Zivn&yacu...
APAL
2004
87views more  APAL 2004»
13 years 7 months ago
Expressive equivalence of least and inflationary fixed-point logic
We study the relationship between least and inflationary fixed-point logic. In 1986, Gurevich and Shelah proved that in the restriction to finite structures, the two logics have t...
Stephan Kreutzer
AAAI
1998
13 years 9 months ago
Fixpoint 3-Valued Semantics for Autoepistemic Logic
The paper presents a constructive 3-valued semantics for autoepistemic logic (AEL). We introduce a derivation operator and de ne the semantics as its least xpoint. The semantics is...
Marc Denecker, V. Wiktor Marek, Miroslaw Truszczyn...
BIRTHDAY
2003
Springer
14 years 29 days ago
Fair Equivalence Relations
Equivalence between designs is a fundamental notion in verification. The linear and branching approaches to verification induce different notions of equivalence. When the designs...
Orna Kupferman, Nir Piterman, Moshe Y. Vardi
CORR
2010
Springer
162views Education» more  CORR 2010»
13 years 4 months ago
Cross-Composition: A New Technique for Kernelization Lower Bounds
We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance o...
Hans L. Bodlaender, Bart M. P. Jansen, Stefan Krat...