Sciweavers

Share
EUROCAST
1994
Springer
139views Hardware» more  EUROCAST 1994»
8 years 8 months ago
Illustrating Constraint Programming Systems in Logistic Planning
Logistic systems analysts use a wide array of modeling systems such as algebraic and logic programs. Two simple examples show how they mesh as Constraint Logic programs, emphasizin...
Jean-Michel Thizy
LPKR
1997
Springer
8 years 8 months ago
Knowledge Representation with Logic Programs
In this overview we show how Knowledge Representation (KR) can be done with the help of generalized logic programs. We start by introducing the core of PROLOG, which is based on de...
Gerhard Brewka, Jürgen Dix
LOPSTR
1997
Springer
8 years 8 months ago
Implicit Program Synthesis by a Reversible Metainterpreter
Synthesis of logic programs is considered as a special instance of logic programming. We describe experience made within a logical metaprogramming environment whose central compone...
Henning Christiansen
ECP
1997
Springer
130views Robotics» more  ECP 1997»
8 years 8 months ago
Encoding Planning Problems in Nonmonotonic Logic Programs
We present a framework for encoding planning problems in logic programs with negation as failure, having computational e ciency as our major consideration. In order to accomplish o...
Yannis Dimopoulos, Bernhard Nebel, Jana Koehler
LOPSTR
1999
Springer
8 years 8 months ago
Roles of Program Extension
Abstract. A formal and effective approach to the extension of the computational behaviour of logic programs is presented. The approach builds upon the following concepts. The exte...
Ralf Lämmel, Günter Riedewald, Wolfgang ...
ICLP
1999
Springer
8 years 8 months ago
Bounded Nondeterminism of Logic Programs
We introduce the notion of bounded nondeterminism for logic programs and queries. A program and a query have bounded nondeterminism if there are finitely many refutations for the...
Dino Pedreschi, Salvatore Ruggieri
ESOP
1999
Springer
8 years 8 months ago
Set-Based Failure Analysis for Logic Programs and Concurrent Constraint Programs
This paper presents the rst approximation method of the nite-failure set of a logic program by set-based analysis. In a dual view, the method yields a type analysis for programs wi...
Andreas Podelski, Witold Charatonik, Martin Mü...
ASIAN
1999
Springer
99views Algorithms» more  ASIAN 1999»
8 years 8 months ago
Beyond Tamaki-Sato Style Unfold/Fold Transformations for Normal Logic Programs
Unfold/fold transformation systems for logic programs have been extensively investigated. Existing unfold/fold transformation systems for normal logic programs allow only Tamaki-Sa...
Abhik Roychoudhury, K. Narayan Kumar, C. R. Ramakr...
VRST
1999
ACM
8 years 8 months ago
Visualising logic programs in virtual worlds
Logic Programming as well as Virtual Reality applications have achieved a lot in the last few years. In this paper we present an architecture, a methodology and two simple example...
Themis Panayiotopoulos, Spyros Vosinakis, Sophia K...
CL
2000
Springer
8 years 8 months ago
Logic Program Synthesis in a Higher-Order Setting
We describe a system for the synthesis of logic programs from specifications based on higher-order logical descriptions of appropriate refinement operations. The system has been ...
David Lacey, Julian Richardson, Alan Smaill
books