58 search results - page 10 / 12 » Resolution Proof Systems with Weak Transformation Rules |
LFCS
2007
Springer
15 years 3 months ago
2007
Springer
act Completion (Full Version) Guillaume Burel Claude Kirchner August 6, 2007 Deduction Modulo implements Poincar´e’s principle by identifying deduction and computation as diff...
POPL
1997
ACM
15 years 1 months ago
1997
ACM
Type systems currently available for imperative languages are too weak to detect a significant class of programming errors. For example, they cannot express the property that a l...
CADE
1998
Springer
15 years 1 months ago
1998
Springer
Abstract. leanK is a "lean", i.e., extremely compact, Prolog implementation of a free variable tableau calculus for propositional modal logics. leanK 2.0 includes additio...
UML
2000
Springer
15 years 1 months ago
2000
Springer
In this paper, dynamic meta modeling is proposed as a new approach to the operational semantics of behavioral UML diagrams. The dynamic meta model extends the well-known static met...
ICFEM
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. The integrated logic-based modeling language, Timed Communicating Object Z (TCOZ), is well suited for presenting complete and coherent requirement models for complex real...