Sciweavers

3931 search results - page 109 / 787
» Separation logic and abstraction
Sort
View
JAIR
1998
97views more  JAIR 1998»
14 years 9 months ago
The Divide-and-Conquer Subgoal-Ordering Algorithm for Speeding up Logic Inference
It is common to view programs as a combination of logic and control: the logic part de nes what the program must do, the control part how to do it. The Logic Programming paradigm ...
Oleg Ledeniov, Shaul Markovitch
FTP
1998
Springer
15 years 2 months ago
Higher-Order Modal Logic - A Sketch
Abstract. First-order modal logic, in the usual formulations, is not sufficiently expressive, and as a consequence problems like Frege's morning
Melvin Fitting
APLAS
2007
ACM
15 years 1 months ago
Call-by-Name and Call-by-Value in Normal Modal Logic
Abstract. This paper provides a call-by-name and a call-by-value calculus, both of which have a Curry-Howard correspondence to the minimal normal logic K. The calculi are extension...
Yoshihiko Kakutani
AML
2002
112views more  AML 2002»
14 years 9 months ago
Strong normalization of a symmetric lambda calculus for second-order classical logic
Abstract We extend Barbanera and Berardi's symmetric lambda calculus [2] to second order classical propositional logic and prove its strong normalization.
Yoriyuki Yamagata
DLOG
2007
15 years 8 days ago
Deciding ALBO with Tableau
Abstract. This paper presents a tableau approach for deciding description logics outside the scope of OWL DL and current state-of-the-art tableau-based description logic systems. I...
Renate A. Schmidt, Dmitry Tishkovsky