General Terms. Languages, Performance. Keywords. Semantic Web, Logic Programming. â. This research was sponsored by the U.S. Army Research Labora-.
Univ. Nova de Lisboa. 2825 Monte da Caparica. Portugal. H. Przymusinska. Dept. Computer Science. California State. Polytechnic Univ. Pomona, CA 91768.
aDepartment of Computer Science, Faculty of Science, P.J. ÃSafÃarik ... truth constants) the infimum of truth degree of a for- ... cost reasonable(Hotel, Time),.
Probabilistic Logic Programming. Thomas Lukasiewicz. 1. Abstract. We present a new approach to probabilistic logic pro- grams with a possible worlds ...
A machine learning type of method, called Machine Methods for Discovering ... order logic, this technique allows one to get human-readable forecasting rules ...
programming patterns, systematic program development, design for ... Logic programming has contributed to software engineering more broadly. Other.
Sep 18, 1994 - Dale Miller. Computer and ... Address correspondence to Miller at address above or at .... member X (cons Y L) :- member X L. ...... 12] D. H. D. Warren, \Higher-order extension to PROLOG: are they needed?," Machine.
Jan 11, 1990 - on a personal computer under MS-DOS. The knowledge base has ... programmation logique Prolog avec MS-DOS. La base des.
May 25, 2007 - (Lloyd 2003) that provides the logic programming idioms. Escher ...... Find the time and channel âThe Billâ is screened on 1 Jan 2007.
Human reasoning often involves an explicit process of defeating assumptions. For example ... assumption denials," ISIS-RR-93-19E, Fujitsu Laboratories, 1993.
employment of logic programming as a representational and reasoning tool. It comes ... As a result of the effort to find simple and efficient theorem proving strate-.
(ILP) [28, 30, 33] realizes inductive machine learning in logic programming, which ...... Advances in Inductive Logic Programming, IOS Press/Ohmsha, pp.
puting lowest costs of deriving atoms from finite weighted programs under the ... A bicycle can be assembled by a mechanic from two kits: kit1 and kit2. The.
with stable semantics, as implemented in the ASP solver smodels. Our ... This paper is concerned with extensions of the Answer Set Programming (ASP).
approach to Veri cation of Website Content. Jorge Coelho1 and M ario Florido2. 1 Instituto Superior de Engenharia do Porto & LIACC. 2 University of Porto, ...
For a person, say named John, neighborhood(john; good) means the ... fneighborhood(john; bad), neighborhood(john; average), neighborhood(john; good)g.
h(1; X). The second query involves nding a structure from which two di erent structures can be obtained by .... We will refer to 1;:::;n as the argument types and to as the target type of the type when it is written in ...... W. W. Bledsoe. A maximal
MINERVA, devel- oped by IF Computer, compiles Prolog into its own virtual machine which is then executed in Java. The others are implemented as interpreter ...
rare4. It turns out that in many applications of abduction in AI, the theory T ..... M is a model of an abductive logic framework (P,A,IC) iff there ...... M. Shanahan.
Bob Kowalski has been one of the founders of Abductive Logic Program- ming. .... For example, an abductive solution for the problem that a certain car does not ..... databases, theory update, contradiction removal, system repair problems.
replies, notifying the user and/or automatically forwarding specific messages, all of ..... forward (11, âb@domainâ) and the corresponding send ac- tion, i.e. send ...
Abstract. Belief Logic Programming (BLP) is a novel form of quanti- tative logic .... assigns evidence (also known as degree of belief, certainty, or support) to sets.
programming patterns, systematic program development, design for provability, and .... A colleague, Andrew Davison, told me this was a good starting point for a ...
Department of Computer Science. Macquarie University. University of Victoria. University of New Brunswick. Sydney, NSW 2109, Australia. Victoria, B.C. V8W ...
Chronolog(Z ): Linear-time logic programming Mehmet A. Orgun
William W. Wadge
Weichang Du
Department of Computing Macquarie University Sydney, NSW 2109, Australia
Department of Computer Science University of Victoria Victoria, B.C. V8W 3P6, Canada
Department of Computer Science University of New Brunswick Saint John, N.B., Canada
Abstract This paper introduces Chronolog(Z ), a logic programming language based on a discrete linear-time temporal logic with unbounded past and future. Chronolog(Z ) is suitable for applications involving the notion of dynamic change such as modeling nonterminating computations, the simulation of sequential circuits, and temporal databases. The execution of the programs of the language is based on a resolution-type proof procedure called TiSLD-resolution. A modular extension of Chronolog(Z ) is proposed which can be used to model objects with internal memory.
1 Introduction
Temporal logic has been successfully used as a formalism in concurrent program speci cation and veri cation, modeling temporal databases, and various forms of temporal reasoning. In temporal logic [15], the meanings of formulas vary depending on an implicit time parameter and elements from di erent moments in time can be combined through the use of temporal operators, not by explicit references to time. More recently, a number of logic programming languages based on diverse temporal logics have been proposed: Tempura [12] and Tokio [2] are based on interval logic; Templog [1] and Chronolog [13] are based on linear-time temporal logics and Temporal Prolog [9] is based on linear and branching time temporal logics. In Tempura, programs are systematically transformed into a sequence of state descriptions over an interval that satis es the original program [12]. Templog [1], Temporal Prolog [9] and Chronolog [13] are extensions of logic programming in which temporal logic programs are executed to obtain answers by the use of resolution-type proof procedures. Tokio has a mixed execution mechanism [2]. There are also several attempts at developing semantics of temporal logic languages. Baudinet [3] showed that Templog's proof procedure is sound and
complete; and established the equivalence of the declarative and the operational semantics of Templog programs. Orgun and Wadge [13, 14] provided the semantics of Chronolog programs and outlined a complete proof procedure for the language. Gabbay [10] de ned a resolution procedure for Temporal Prolog and proved its soundness. These results suggest that temporal logic programming is feasible. This paper in particular introduces the temporal language Chronolog(Z ), which is an extension of Chronolog [13], based on a linear-time temporal logic with unbounded past and future with the set Z of integers as the collection of moments in time. The temporal logic of Chronolog(Z ) has an operator to look into the past as well as the operators first and next of Chronolog. The \execution" of Chronolog(Z ) programs is based on a resolution-type proof procedure called TiSLD-resolution. In [14], it is also shown that the declarative and the operational semantics of Chronolog(Z ) programs coincide. Consider the following program that de nes the predicate f which is true of the t + 1 Fibonacci number for time t 0 and no other. th
