Sciweavers

54 search results - page 4 / 11
» MProlog: An Extension of Prolog for Modal Logic Programming
Sort
View
ENTCS
2000
83views more  ENTCS 2000»
13 years 7 months ago
Typed Logical Variables in Haskell
We describe how to embed a simple typed functional logic programming language in Haskell. The embedding is a natural extension of the Prolog embedding by Seres and Spivey [16]. To...
Koen Claessen, Peter Ljunglöf
APLAS
2007
ACM
13 years 11 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
ICLP
1998
Springer
13 years 11 months ago
Compiling Resources in a Linear Logic Programming Language
There have been several proposals for logic programming language based on linear logic: Lolli [6], Lygon [5], LO [3], LinLog [2], Forum [8]. In addition, BinProlog allows the use ...
Mutsunori Banbara, Naoyuki Tamura
ALT
1994
Springer
13 years 11 months ago
Explanation-Based Reuse of Prolog Programs
This paper presents a method of extracting subprograms from background knowledge. Most studies on learning logic programs so far developed are mainly concerned with pure Prolog, so...
Yasuyuki Koga, Eiju Hirowatari, Setsuo Arikawa
FROCOS
2007
Springer
14 years 1 months ago
Idempotent Transductions for Modal Logics
Abstract. We investigate the extension of modal logics by bisimulation quantifiers and present a class of modal logics which is decidable when augmented with bisimulation quanti...
Tim French