The proceedings contain 37 papers. The special focus in this conference is on logicprogramming. The topics include: Real-Time memory management for prolog;a process semantics of logic programs;logical operational sem...
ISBN:
(纸本)9783540554608
The proceedings contain 37 papers. The special focus in this conference is on logicprogramming. The topics include: Real-Time memory management for prolog;a process semantics of logic programs;logical operational semantics of parlog: part II: or-parallelism;properties of algorithmic operators;deep logic program transformation using abstract interpretation;objects in a logicprogramming framework;integrity verification in knowledge bases;on procedural semantics of metalevel negation;probabilistic logic programs and their semantics;implementation of prolog as binary definite programs;prolog semantics for measuring space consumption;or-parallel prolog with heuristic task distribution;a WAM compilation scheme;safe positive induction in the programminglogic TK;WAM specification for parallel execution on SIMD computer;on abstracting the procedural behaviour of logic programs;treating enhanced entity relationship models in a declarative style;processing of ground regular terms in prolog;compiling flang;FIDO: finite domain consistency techniques in logicprogramming;a constructive logic approach to database theory;abstract syntax andlogicprogramming;deduction search with generalized terms;logicprogramming with pseudo-resolution;BRAVE: an or-parallel dialect of prolog and its application to artificial intelligence;a declarative debugging environment for DATALOG;a sequent calculus for a first order linear temporal logic with explicit time;a logical-based language for feature specification and transmission control;program transformations and WAM-support for the compilation of definite metaprograms;logicprogramming with bounded quantifiers.
We prove that the Cutting Plane proof system based on Gomory-Chvatal cuts polynomially simulates the lift-and-project system with integer coefficients written in unary. The restriction on the coefficients can be omitt...
详细信息
We prove that the Cutting Plane proof system based on Gomory-Chvatal cuts polynomially simulates the lift-and-project system with integer coefficients written in unary. The restriction on the coefficients can be omitted when using Krajicek's cut-free Gentzen-style extension of both systems. We also prove that Tseitin tautologies have short proofs in this extension (of any of these systems and with any coefficients). (c) 2005 Elsevier B.V. All rights reserved.
This paper deals with the problem of efficient implementation of the interface between Prolog and conventional programming languages. We show how types may be used in Prolog to support various run-time representations...
详细信息
The aim of this paper is to generalize logic programs, for dealing with probabilistic knowledge. Using the possible-worlds approach of probabilistic logic ([Nil]), we define probabilistic logic programs so that their ...
详细信息
Some basic notions of object-oriented programming such as objects, messages and inheritance are provided of a clean definition according to the logicprogramming paradigm. Objects are represented by logic theories, wh...
详细信息
Abstract interpretation is a widely applied method for doing static analysis of logic programs. A diversity of formalisms and applications have appeared in the literature. This paper describes at a rather informal lev...
详细信息
An efficient method for generating derivable objects in calculuses over terms is proposed. The method is based on the fact that inference rules may require only partial information about their premises. It means that ...
详细信息
暂无评论