2573 search results - page 333 / 515 » Combinations of Modal Logics |
138
click to vote
AGP
1999
IEEE
15 years 11 months ago
1999
IEEE
In this paper we present a novel extension to the constraint logic programming on Finite Domains (clp(FD)) which combines the usual clp(FD) primitive constraint X in range with a ...
158
click to vote
ICCAD
1999
IEEE
15 years 11 months ago
1999
IEEE
We introduce a new method of verifying the timing of custom CMOS circuits. Due to the exponential number of patterns required, traditional simulation methods are unable to exhaust...
142
click to vote
AGP
1998
IEEE
15 years 10 months ago
1998
IEEE
Parsing has been a traditional workbench for showing the virtues of declarative programming. Both logic and functional programming claim the ability of writing parsers in a natura...
178
click to vote
BIRTHDAY
1997
Springer
15 years 10 months ago
1997
Springer
We compare the expressive power on finite models of two extensions of first order logic L with equality. L(Ct) is formed by adding an operator count{x : ϕ}, which builds a term ...
176
click to vote
FMCAD
2009
Springer
15 years 10 months ago
2009
Springer
Abstract--The theory of arrays is ubiquitous in the context of software and hardware verification and symbolic analysis. The basic array theory was introduced by McCarthy and allow...