Sciweavers

503 search results - page 29 / 101
» Interpolative Boolean Logic
Sort
View
92
Voted
ENTCS
2008
102views more  ENTCS 2008»
15 years 1 months ago
Soft Linear Logic and Polynomial Complexity Classes
We describe some results inspired to Lafont's Soft Linear Logic (SLL) which is a subsystem of second-order linear logic with restricted rules for exponentials, correct and co...
Marco Gaboardi, Jean-Yves Marion, Simona Ronchi De...
CSL
2008
Springer
15 years 2 months ago
Characterization of Logics over Ranked Tree Languages
We study the expressive power of the logics EF + F-1 , 2 and boolean combinations of 1 over ranked trees. In particular, we provide effective characterizations of those three logic...
Thomas Place
106
Voted
CADE
2008
Springer
16 years 1 months ago
The Logical Difference Problem for Description Logic Terminologies
Abstract. We consider the problem of computing the logical difference between distinct versions of description logic terminologies. For the lightweight description logic EL, we pre...
Boris Konev, Dirk Walther, Frank Wolter
DAC
2001
ACM
16 years 2 months ago
Circuit-based Boolean Reasoning
Many tasks in CAD, such as equivalence checking, property checking, logic synthesis, and false paths analysis require efficient Boolean reasoning for problems derived from circuit...
Andreas Kuehlmann, Malay K. Ganai, Viresh Paruthi
SAT
2007
Springer
96views Hardware» more  SAT 2007»
15 years 7 months ago
From Idempotent Generalized Boolean Assignments to Multi-bit Search
Abstract. This paper shows that idempotents in finite rings of integers can act as Generalized Boolean Assignments (GBA’s) by providing a completeness theorem. We introduce the ...
Marijn Heule, Hans van Maaren