Abstract: The paper describes the implementation of a parallel graph narrowing machine. The machine implements a functional logic language on a shared memory multiprocessor. The model of parallelism uses an independence condition to decide which subexpressions of an expression can run in parallel

this paper we identify another restriction of FO, the d-Horn fragment, that possesses the same low complexity for showing unsatis ability and has a nice model theoretic characterization: the set of d-Horn for47 mulas is precisely the set of formulas whose validity is preserved under dual reduced products of models, an operation we de ne as a variant of the ordinary reduced product. We will show in detail that the expressive power oered by the d-Horn fragment is very dierent from that oered by the Horn fragment, and show that arbitrary context free grammars can be captured using Horn together with d-Horn formulas

We propose a novel formalism, called Frame Logic (abbr., F-logic), that accounts in a clean and declarative fashion for most of the structural aspects of object-oriented and frame-based languages. These features include object identity, complex objects, inheritance, polymorphic types, query methods

Sentences in first-order predicate logic can be usefully interpreted as programs In this paper the operational and fixpoint semantics of predicate logic programs are defined, and the connections with the proof theory and model theory of logic are investigated It is concluded that operational

This paper proposes a new logic programming language called GOLOG whose interpreter automatically maintains an explicit representation of the dynamic world being modeled, on the basis of user supplied axioms about the preconditions and effects of actions and the initial state of the world

Starting from a simple declarative all-solutions program, we develop a variety of search programs in the concurrent logic language RGDC [Cohen et al 92], leading up to a full heuristics-guided parallel version of branch-and-bound search. Our programs are general enough to be useable in a variety

ESSLLI 2008 is organized by the Universität Hamburg under the auspices of the Association for Logic, Language and Information (FoLLI). The Institute for Logic, Language and Computation (ILLC) of the Universiteit van Amsterdam is providing important infrastructural support. Within the Universität

variety of temporal logic: alternating-time temporal logic offers selective quantification over those paths that are possible outcomes of games, such as the game in which the system and the environment alternate moves. While linear-time and branching-time logics are natural specification languages

-theoretic semantics of a language AgentSpeak(L). This language can be viewed as an abstraction of one of the implemented BDI systems (i.e., PRS) and allows agent programs to be written and interpreted in a manner similar to that of horn-clause logic programs. We show how to perform derivations in this logic using a

Escher is a general-purpose, declarative programming language that integrates the best features of both functional and logic programming languages. It has types and modules, higher-order and meta-programming facilities, concurrency, and declarative input/output. The main design aim is to combine