Automatic IP (intellectual property) matching is a key to the reuse of IP cores. A new tabled logic programming-based IP matching algorithm is given that can check whether a given programmable IP can be adapted to mat...
详细信息
Automatic IP (intellectual property) matching is a key to the reuse of IP cores. A new tabled logic programming-based IP matching algorithm is given that can check whether a given programmable IP can be adapted to match a given specification. When such adaptation is possible, the algorithm also generates a device driver (an interface) to adapt the IP. Though simulation, refinement and bisimulation algorithms exist, they cannot be used to check the adaptability of an IP, which is the essence of reuse. The IP matching algorithm is based on a formal verification technique called forced simulation. A forced simulation matching algorithm is implemented using a tabled logic programming environment, which provides distinct advantages for encoding such an algorithm. The tool has been used to match several specifications to programmable IN, achieving on an average 12 times speedup and 64% reduction in code size in comparison with previously published algorithms.
We present the distributed implementation of a new communication model for concurrent logic programming. The main novelty with respect to STREAM-parallel logic languages is that inter-process communication is performe...
详细信息
We present the distributed implementation of a new communication model for concurrent logic programming. The main novelty with respect to STREAM-parallel logic languages is that inter-process communication is performed via multiple-headed clauses, rather than by variables shared among AND processes. We describe an abstract machine for the model which extends the Warren Abstract Machine.
Context-aware pervasive systems are emerging as an important class of applications. Such systems can respond intelligently to contextual information about the physical world acquired via sensors and information about ...
详细信息
Context-aware pervasive systems are emerging as an important class of applications. Such systems can respond intelligently to contextual information about the physical world acquired via sensors and information about the computational environment. A declarative approach to building context-aware pervasive systems is presented, and the notion of the situation program is introduced, which highlights the primacy of the situation abstraction for building context-aware pervasive systems. There is also a demonstration of how to manipulate situation programs using metaprogramming within an extension of the Prolog logic programming language which is called logicCAP. Such meta-reasoning enables complex situations to be described in terms of other situations. Furthermore, a discussion is given on how the design of situation programs can affect the properties of a context-aware system. The approach encourages a high-level of abstraction for representing and reasoning with situations, and supports building context-aware systems incrementally by providing modularity and separation of concerns.
We give a framework for developing the least model semantics, fixpoint semantics, and SLD-resolution calculi for logic programs in multimodal logics whose frame restrictions consist of the conditions of seriality (i.e...
详细信息
We give a framework for developing the least model semantics, fixpoint semantics, and SLD-resolution calculi for logic programs in multimodal logics whose frame restrictions consist of the conditions of seriality (i.e. for all x there exists y R-i (x, y)) and some classical first-order Horn clauses. Our approach is direct and no special restriction on occurrences of square(i) and lozenge(i) is required. We apply our framework for a large class of basic serial multimodal logics, which are parameterized by an arbitrary combination of generalized versions of axioms T, B, 4, 5 (in the form, e.g. 4 : square(i) phi -> square(j)square(k)phi) and I : square(i) phi -> square(j)phi. Another part of the work is devoted to programming in multimodal logics intended for reasoning about multidegree belief, for use in distributed systems of belief, or for reasoning about epistemic states of agents in multiagent systems. For that we also use the framework, and although these latter logics belong to the mentioned class of basic serial multimodal logics, the special SLD-resolution calculi proposed for them are more efficient. (C) 2006 Elsevier B.V. All rights reserved.
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...
详细信息
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. This allows programs to reason about the state of the world and consider the effects of various possible courses of action before committing to a particular behavior. The net effect is that programs may be written at a much higher level of abstraction than is usually possible. The language appears well suited for applications in high level control of robots and industrial processes, intelligent software agents, discrete event simulation, etc. It is based on a formal theory of action specified in an extended version of the situation calculus. A prototype implementation in Prolog has been developed. (C) 1997 Elsevier Science Inc., 1997.
In this paper we describe some novel features that have been introduced into a logic programming language. These include: (1) an increased level of clause expressiveness through the introduction of constructors for ad...
详细信息
In this paper we describe some novel features that have been introduced into a logic programming language. These include: (1) an increased level of clause expressiveness through the introduction of constructors for addition and multiplication, resulting in a system capable of being programmed to solve systems of linear equations; and (2) a search that produces a stream of bindings, permitting a higher degree of user interaction. The new language, referred to as CELP (computationally extended logic programming) has been implemented in Scheme, a dialect of Lisp. The version Scheme 84, developed at Indiana University and written in Franz Lisp, was used as the source language for our system.
We introduce a constraint system called FT. This system offers a theoretical and practical alternative to the usual Herbrand system of constraints over constructor trees. Like Herbrand, FT provides a universal data st...
详细信息
We introduce a constraint system called FT. This system offers a theoretical and practical alternative to the usual Herbrand system of constraints over constructor trees. Like Herbrand, FT provides a universal data structure based on trees. However, the trees of FT (called feature trees) are more general than the constructor trees of Herbrand, and the constraints of FT are of finer grain and of different expressiveness. The essential novelty of FT is provided by functional attributes called features which allow representing data as extensible records, a more flexible way than that offered by Herbrand's fixed arity constructors. The feature tree structure determines an algebraic semantics for FT. We establish a logical semantics, thanks to three axiom schemes presenting the first-order theory FT. We propose using FT as a constraint system for logic programming. We provide a test for constraint unsatisfiability, and a test for constraint entailment. The former corresponds to unification and the latter to matching. The combination of the two is needed for advanced control mechanisms. We use the concept of relative simplification of constraints, a normalization process that decides entailment and unsatisfiability simultaneously. The two major technical contributions of this work are: (i) an incremental system performing relative simplification for FT that we prove to be sound and complete;and (ii) a proof showing that FT satisfies independence of negative constraints, the property that conjoined negative constraints may be handled independently.
Software testing is one of the most popular validation techniques in the software industry. Surprisingly, we can only find a few approaches to testing in the context of logic programming. In this paper, we introduce a...
详细信息
Software testing is one of the most popular validation techniques in the software industry. Surprisingly, we can only find a few approaches to testing in the context of logic programming. In this paper, we introduce a systematic approach for dynamic testing that combines both concrete and symbolic execution. Our approach is fully automatic and guarantees full path coverage when it terminates. We prove some basic properties of our technique and illustrate its practical usefulness through a prototype implementation.
logic programming and object-oriented programming have made significant contributions to the field of artificial intelligence, particularly as knowledge-based system development tools. Both these tools are extremely p...
详细信息
logic programming and object-oriented programming have made significant contributions to the field of artificial intelligence, particularly as knowledge-based system development tools. Both these tools are extremely powerful and have several interesting features for application developers to exploit. The paper examines the potential benefits of integrating these two technologies to develop large knowledge-based applications, using each for what it does best. The salient features of the object-oriented and logic programming paradigms are summarized, and the advantages of combining them are discussed. A possible strategy is also provided for implementing the object-oriented paradigm within the logic-programming environment.
In this paper, we present an implementation model which efficiently supports backtracking in an independent and-parallel nondeterministic system. The problem is tackled in the context of logic programming, although th...
详细信息
In this paper, we present an implementation model which efficiently supports backtracking in an independent and-parallel nondeterministic system. The problem is tackled in the context of logic programming, although the solution proposed is sufficiently general to be easily extended to different nondeterministic systems, such as constraint programming systems. The complexity of the problem is demonstrated by the fact that most existing and-parallel systems either do not support backtracking over and-parallel calls or simply avoid analyzing the performance of their systems in the presence of nondeterministic benchmarks. The implementation model we present is an extension of the backtracking scheme developed by Hermenegildo and Nasr [31] and relies on a novel memory organization scheme and on the use of various optimizations to reduce communication and overhead. The solution developed has been implemented in the ACE Parallel Prolog system. The performance of the system is analyzed on a variety of benchmarks. The results obtained are remarkable: Speedups achieved during forward execution are riot lost in heavy backtracking activities and, frequently, super-linear speedups are obtained thanks to a semi-intelligent backtracking scheme.
暂无评论