2573 search results - page 168 / 515 » Combinations of Modal Logics |
131
click to vote
CADE
2002
Springer
16 years 5 months ago
2002
Springer
Decision procedures for combinations of theories are at the core of many modern theorem provers such as ACL2, Ehdm, PVS, SIMPLIFY, the Stanford Pascal Verifier, STeP, SVC, and Z/Ev...
141
click to vote
ICCAD
2006
IEEE
16 years 1 months ago
2006
IEEE
The paper explores several ways to improve the speed and capacity of combinational equivalence checking based on Boolean satisfiability (SAT). State-of-the-art methods use simulat...
181
click to vote
ILP
2007
Springer
15 years 10 months ago
2007
Springer
Statistical Relational Learning (SRL) combines the benefits of probabilistic machine learning approaches with complex, structured domains from Inductive Logic Programming (ILP). W...
149
click to vote
APLAS
2004
ACM
15 years 10 months ago
2004
ACM
Developing computer systems that are both concurrent and evolving is challenging. To guarantee consistent access to resources by concurrent software components, some synchronizatio...
142
click to vote
TPHOL
1999
IEEE
15 years 9 months ago
1999
IEEE
Combining theorem proving and model checking o ers the tantalizing possibility of e ciently reasoning about large circuits at high levels of abstraction. We have constructed a syst...