Sciweavers

1916 search results - page 121 / 384
» Reasoning with class algebra
Sort
View
84
Voted
VLSID
2004
IEEE
108views VLSI» more  VLSID 2004»
16 years 1 months ago
Boolean Decomposition Using Two-literal Divisors
This paper is an attempt to answer the following question: how much improvement can be obtained in logic decomposition by using Boolean divisors? Traditionally, the existence of t...
Nilesh Modi, Jordi Cortadella
216
Voted
POPL
2004
ACM
16 years 1 months ago
Polymorphic typed defunctionalization
Defunctionalization is a program transformation that aims to turn a higher-order functional program into a first-order one, that is, to eliminate the use of functions as first-cla...
François Pottier, Nadji Gauthier
71
Voted
LICS
2006
IEEE
15 years 6 months ago
A Characterisation of First-Order Constraint Satisfaction Problems
Abstract. We describe simple algebraic and combinatorial characterisations of finite relational core structures admitting finitely many obstructions. As a consequence, we show th...
Benoit Larose, Cynthia Loten, Claude Tardif
126
Voted
GISCIENCE
2004
Springer
136views GIS» more  GISCIENCE 2004»
15 years 6 months ago
Simplifying Sets of Events by Selecting Temporal Relations
Reasoning about events or temporal aspects is fundamental for modeling geographic phenomena. This work concerns the analysis of events as configurations of temporal intervals. It...
Andrea Rodríguez, Nico Van de Weghe, Philip...
109
Voted
FM
2003
Springer
98views Formal Methods» more  FM 2003»
15 years 6 months ago
Generating Counterexamples for Multi-valued Model-Checking
Counterexamples explain why a desired temporal logic property fails to hold, and as such are considered to be the most useful form of output from model-checkers. Multi-valued model...
Arie Gurfinkel, Marsha Chechik