147 search results - page 17 / 30 » A Sound and Complete Diagrammatic Reasoning System |
WISE
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Approximation has been identified as a potential way of reducing the complexity of logical reasoning. Here we explore approximation for speeding up instance retrieval in...
CADE
2002
Springer
14 years 7 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...
FROCOS
2009
Springer
14 years 5 days ago
2009
Springer
We discuss a new concept of agent programs that combines logic programming with reasoning about actions. These agent logic programs are characterized by a clear separation between ...
DEON
2004
Springer
13 years 11 months ago
2004
Springer
Often a set of imperatives or norms seems satisfiable from the outset, but conflicts arise when ways to fulfill all are ruled out by unfortunate circumstances. Semantic methods to ...
LICS
1991
IEEE
13 years 11 months ago
1991
IEEE
Baeten, Bergstra, and Klop (and later Caucal) have proved the remarkable result that bisimulation equivalence is decidable for irredundant context-free grammars. In this paper we ...