169 search results - page 17 / 34 » GLukG logic and its application for non-monotonic reasoning |
CADE
1992
Springer
14 years 21 days 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 ...
COOPIS
2002
IEEE
14 years 1 months ago
2002
IEEE
This paper makes two main contributions towards establishing support for application-specific factors in middleware security mechanisms. First, it develops a simple classification...
CSL
1999
Springer
14 years 27 days ago
1999
Springer
Hybrid languages are extended modal languages which can refer to (or even quantify over) states. Such languages are better behaved proof theoretically than ordinary modal languages...
CADE
1998
Springer
14 years 26 days ago
1998
Springer
Abstract. We present a theorem proving environment for the development of reliable and efficient group communication systems. Our approach makes methods of automated deduction appl...
CSL
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...