3776 search results - page 261 / 756 » Partition-Based Logical Reasoning |
139
click to vote
LOPSTR
1994
Springer
15 years 8 months ago
1994
Springer
A technique for transformation of definite logic programs is presented. A first phase performs an analysis of the extended call/exit patterns of the source program. It is shown tha...
145
click to vote
LPAR
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. The ZETA system is a Z-based tool environment for developing formal specifications. It contains a component for executing the Z language based on the implementation techn...
142
click to vote
DLOG
2006
15 years 5 months ago
2006
Tree automata are often used for satisfiability testing in the area of description logics, which usually yields ExpTime complexity results. We examine conditions under which this ...
140
click to vote
CSL
2006
Springer
15 years 4 months ago
2006
Springer
In a data word or a data tree each position carries a label from a finite alphabet and a data value from some infinite domain. These models have been considered in the realm of sem...
134
click to vote
CSL
2002
Springer
15 years 4 months ago
2002
Springer
Abstract. We give a simple term calculus for the multiplicative exponential fragment of Classical Linear Logic, by extending Barber and Plotkin's system for the intuitionistic...