1391 search results - page 148 / 279 » Completeness of Neighbourhood Logic |
TABLEAUX
2005
Springer
14 years 3 months ago
2005
Springer
We extend classical first-order logic with subtyping by type predicates and type coercion. Type predicates assert that the value of a term belongs to a more special type than the ...
AMAST
2000
Springer
14 years 2 months ago
2000
Springer
The behavior of reactive systems is typically speci ed by state machines. This results in an operational description of how a system its output. An alternative and more abstract ap...
CADE
1992
Springer
14 years 1 months ago
1992
Springer
There are syntactically identifiable situations in which reduction does not occur in chain format linear deduction systems, i.e. situations in which linear-input subdeductions are ...
CADE
1990
Springer
14 years 1 months ago
1990
Springer
In automated deduction systems that are intended for human use, the presentation of a proof is no less important than its discovery. For most of today's automated theorem pro...
EURODAC
1990
IEEE
14 years 1 months ago
1990
IEEE
: In this paper logical cells and algorithms are presented supporting the design of pseudo-exhaustively testable circuits. The approach is based on real hardware segmentation, inst...