193 search results - page 9 / 39 » Automated Reasoning in Kleene Algebra |
LICS
1998
IEEE
15 years 4 months ago
1998
IEEE
In his well-known paper \How computer should think" ( Be77b]) Belnap argues that four-valued semantics is a very suitable setting for computerized reasoning. In this paper we...
TPHOL
1999
IEEE
15 years 4 months ago
1999
IEEE
We present a development of Universal Algebra inside Type Theory, formalized using the proof assistant Coq. We define the notion of a signature and of an algebra over a signature. ...
CADE
2008
Springer
16 years 2 days ago
2008
Springer
Relation algebras provide abstract equational axioms for the calculus of binary relations. They name an established area of mathematics with various applications in computer scienc...
FLOPS
2004
Springer
15 years 5 months ago
2004
Springer
This paper presents a complete (infinite) axiomatization for an algebraic construction of graphs, in which a finite fragment denotes the class of graphs with bounded tree width.
IJCAI
1997
15 years 1 months ago
1997
Theoremsin automated theorem proving are usually proved by logical formal proofs. However,there is a subset of problems which humanscan prove in a different wayby the use of geome...