154 search results - page 13 / 31 » Using Proofs by Coinduction to Find |
ACL
1989
13 years 9 months ago
1989
The logic behind parsers for categorial grammars can be formalized in several different ways. Lambek Calculus (LC) constitutes an example for a natural deduction 1 style parsing m...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Existential fixed point logic (EFPL) is a natural fit for some applications, and the purpose of this talk is to attract attention to EFPL. The logic is also interesting in its own ...
AAAI
2004
13 years 9 months ago
2004
A logic of conditional preferences is defined, with a language which allows the compact representation of certain kinds of conditional preference statements, a semantics and a pro...
CADE
2003
Springer
14 years 8 months ago
2003
Springer
Foundational certified code systems seek to prove untrusted programs to be safe relative to safety policies given in terms of actual machine architectures, thereby improving the s...
RSP
1999
IEEE
14 years 4 days ago
1999
IEEE
Formal methods are a nice idea, but the size and complexity of real systems means that they are impractical. We propose that a reasonable alternative to attempting to specify and ...