79 search results - page 6 / 16 » Splitting Logics |
102
Voted
CORR
2004
Springer
14 years 9 months ago
2004
Springer
In this paper, we present a framework for automatic generation of CHR solvers given the logical specification of the constraints. This approach takes advantage of the power of tab...
ICCAD
1997
IEEE
15 years 1 months ago
1997
IEEE
We present a novel method for state minimization of incompletely-specified finite state machines. Where classic methods simply minimize the number of states, ours directly addre...
SECURWARE
2008
IEEE
15 years 3 months ago
2008
IEEE
Trust network analysis with subjective logic (TNA-SL) simplifies complex trust graphs into series-parallel graphs by removing the most uncertain paths to obtain a canonical graph...
82
Voted
CADE
2009
Springer
15 years 4 months ago
2009
Springer
SPASS is an automated theorem prover for full first-order logic with equality and a number of non-classical logics. This system description provides an overview of our recent deve...
CADE
2009
Springer
15 years 10 months ago
2009
Springer
We present a new calculus for first-order theorem proving with equality, ME+Sup, which generalizes both the Superposition calculus and the Model Evolution calculus (with equality)...