Sciweavers

377 search results - page 4 / 76
» Modular logic metaprogramming
Sort
View
PPCP
1993
13 years 9 months ago
Higher-Order Logic Programming as Constraint Logic Programming
Higher-order logic programming (HOLP) languages are particularly useful for various kinds of metaprogramming and theorem proving tasks because of the logical support for variable ...
Spiro Michaylov, Frank Pfenning
KRDB
1996
123views Database» more  KRDB 1996»
13 years 7 months ago
Flexible Query-Answering Systems Modelled in Metalogic Programming
Metaprogramming adds new expressive power to logic programming which can be advantageous to transfer to the field of deductive databases. We propose metaprogramming as a way to mo...
Troels Andreasen, Henning Christiansen
LISP
2008
97views more  LISP 2008»
13 years 5 months ago
Efficient and flexible access control via Jones-optimal logic program specialisation
We describe the use of a flexible meta-interpreter for performing access control checks on deductive databases. The meta-program is implemented in Prolog and takes as input a datab...
Steve Barker, Michael Leuschel, Mauricio Varea
FOAL
2007
ACM
13 years 9 months ago
Aspects and modular reasoning in nonmonotonic logic
Nonmonotonic logic is a branch of logic that has been developed to model situations with incomplete information. We argue that there is a connection between AOP and nonmonotonic l...
Klaus Ostermann
ENTCS
2008
124views more  ENTCS 2008»
13 years 5 months ago
Modular Games for Coalgebraic Fixed Point Logics
We build on existing work on finitary modular coalgebraic logics [3,4], which we extend with general fixed points, including CTL- and PDL-like fixed points, and modular evaluation...
Corina Cîrstea, Mehrnoosh Sadrzadeh