441.
Probabilistic Logic Programming
- Thomas Lukasiewicz
. We present a new approach to probabilistic logic programs
with a possible worlds semantics. Classical program clauses
are extended by a subinterval of [0; 1] that describes the range for
the conditional probability of the head of a clause given its body.
We show that deduction in the defined probabilistic logic programs
is computationally more complex than deduction in classical logic
programs. More precisely, restricted deduction problems that are Pcomplete
for classical logic programs are already NP-hard for probabilistic
logic programs. We then elaborate a linear programming approach
to probabilistic deduction that is efficient in interesting special
cases. In the best case, the generated linear programs have a number
of...
442.
A Nonmonotonic Observation Logic
- Frans Voorbraak
A variant of Reiter's default logic is proposed as a logic for reasoning with
(defeasible) observations. Traditionally, default rules are assumed to represent
generic information and the facts are assumed to represent specific information
about the situation, but in this paper, the specific information derives from defeasible
observations represented by (normal free) default rules, and the facts represent
(hard) background knowledge. Whenever the evidence underlying some
observation is more refined than the evidence underlying another observation,
this is modelled by means of a priority between the default rules representing
the observations. We thus arrive at an interpretation of prioritized normal free
default logic as an observation logic, and we...
443.
Probabilistic Logic Programming
- Thomas Lukasiewicz
. We present a new approach to probabilistic logic programs
with a possible worlds semantics. Classical program clauses
are extended by a subinterval of [0; 1] that describes the range for
the conditional probability of the head of a clause given its body.
We show that deduction in the defined probabilistic logic programs
is computationally more complex than deduction in classical logic
programs. More precisely, restricted deduction problems that are Pcomplete
for classical logic programs are already NP-hard for probabilistic
logic programs. We then elaborate a linear programming approach
to probabilistic deduction that is efficient in interesting special
cases. In the best case, the generated linear programs have a number
of...
444.
CS302 - Logic Programming
- Gordon Royle
This document consists of the lecture notes for the Logic Programming course given at the University
of Western Australia. This course involves both theoretical logic programming and its practice as
exemplied by the Prolog programming language. The theoretical portions are heavily based on [4],
and a portion of this text is essentially a reordering of the material contained therein. The portions
on Prolog and propositional logic are based on material from a variety of sources ([1],[6] [2],[5]).
445.
Fluent Logic Programming
- Vincenzo Pallotta
The goal of this paper is to show how it is possible to design a logic
programming based action language, which we call Fluent Logic Programming
(FLP) integrating two action formalisms: Erik Sandewall's Features
& Fluents discrete features logic (DFL) and the Kowalski-Sergot's Event
Calculus (EC). The semantics of FLP is presented in two complementary
ways, namely by means of a x-point semantics and of a meta-logical semantics.
446.
A Plural Resolution Logic
- Rick Nouwen
This paper presents an integration of centering theory into incremental
dynamic logic. It furthermore discusses how such a combined system could deal
with plural pronoun resolution.
447.
A Dynamic Logic Formalisation
- Raquel Fernfindez
This paper explores the possibility of
using the paradigm of Dynamic Logic
(DL) to formalise information states and
update processes on information states.
448.
A UNITY-style Programming Logic for Shared Dataspace Programs
- H. Conrad Cunningham; H. Conrad; Gruia-Catalin Roman
The term shared dataspace refers to the general class of programming languages in which the principal means of communication among the concurrent components of programs is a common, content-addressable data structure called a dataspace. In the programming language and artificial intelligence communities, there is considerable interest in such languages, e.g., logic-based languages, production rule systems, and the Linda language. However, these languages have not been the subject of extensive program verification research. This paper specifies a proof system for a shared dataspace programming notation called Swarm---a programming logic similar in style to that of UNITY. The paper then uses the...
449.
A Temporal Logic for Events and States in Petri Nets
- Ekkart Kindler; Tobias Vesper
In some phases of system development state-based methods are adequate; in others event-based methods are adequate. Petri nets provide a system model which supports both methods and thus allow a smooth transition between the different phases of system development. Most temporal logics for Petri nets, however, do not support both methods. In this paper we introduce a temporal logic for Petri nets which allows to argue on states as well as on events. This way, specifications in the early phases can be event based and verification in later phases can be state-based within a single formalism. Keywords: Temporal logic; event-based;...
450.
The Inverse Method for Intuitionistic Linear Logic (The Propositional Fragment)
- Kaustuv Chaudhuri
We present a forward sequent calculus for intuitionistic propositional linear logic (⊗, 1, �, ⊤, ❜ , ⊕, 0,!) and a corresponding inverse-method search strategy. Our approach centres around resource management, inspired by similar approaches for backward-directed calculi such as top-down linear logic programming. Surprisingly, the resource management problems for the forward direction turn out to have a different character to those of the backward direction, arising for different connectives. Our approach identifies conditions for which we may relax linearity to allowing (implicit) weakening. We characterize two such classes of affine behaviour – as a form of weak sequent designed...
451.
A Compiled-Code Parallel Pattern Logic Simulator With Inertial Delay Model
- Kuo Chan Huang; Chung Len; Lee; Jwu E Chen
This paper presents a parallel pattern compiled code logic simulator which can handle the transport delay as well as the inertial delay of the logic gate. It uses Potential-Change Frame, incorporating inertial functions, to execute event-canceling operation of gates, thus eliminating the conventional time wheel mechanism. As a result, it can adopt the parallel pattern strategy to increase the simulation speed. Furthermore, it is a compiled code simulator, which further improves its performance. Experimental results show that it significantly surpasses the conventional time wheel event-driven simulator in terms of simulation speed. In addition, it is also found that a significant...
452.
A NOVEL AND FAST VIRTUAL SURGICAL SYSTEM USING FUZZY LOGIC
- Shanthanand Kutuva; Narender P. Reddy; Yingcai Xiao; Xiaosheng Gao; S. I. Hariharan; Saket Kulkarni
Virtual Reality (VR) and associated technologies are experiencing growing importance in medicine and surgery. VR demands fast and real time simulations. Finite element analysis can be used for cutting simulation; however, finite element analysis is computationally intensive and is unsuitable for real time applications involving cutting of a large amount of tissue. We have developed a fuzzy logic based system which involves significantly reduced computational times and provides real time simulations of cutting. The user-exerted forces on a simulated cutting tool held by the user are dynamically measured and fed to the fuzzy logic system. The user-exerted forces and the...
453.
On Successive Approximations To The Choice Problem and Logic
- Bulitko, Valeriy
This paper studies the formation of logical operations from pre-logical
processes. We are concerned with the reasons for certain mental processes
taking form of logical reasoning and the underlying drives for consolidation of
logical operations in human mind. Starting from Piaget's approach to Logic
(Piaget, 1956) we discuss whether the evolutionary adaptation can be such a
driving force and whether the limits of human mind can result in the standard
system of logical operations. The paper demonstrates that the classical
two-valued propositional logic can begin from a method of successive
approximations applied to a decision-making problem within a framework of
Subject-in-an-environment survival. The presented results shed a new light...
454.
Using Fuzzy Logic to Recognize Geometric Shapes Interactively
- Manuel J. Fonseca; Joaquim A. Jorge
This paper presents a simple method, based on fuzzy logic, to recognize multi-stroke sketches of geometric shapes and uni-stroke gestural commands. It uses temporal adjacency and global geometric properties of figures to recognize a simple vocabulary of geometric shapes drawn in different line styles. The geometric features used (convex hull, largest-area inscribed and smallest-area enclosing polygons, perimeter and area ratios) are invariant with rotation and scale of figures. Through experimental evaluation we have found the method very usable with acceptable recognition rates although the multi-stroke approach poses problems in choosing appropriate values for timeouts. Although we have privileged simplicity over...
455.
TransLog, an interactive tool for transformation of logic programs
- Jacob Brunekreef
This report describes `TransLog', a prototype of a transformation tool for logic programs. The tool has been developed with the ASF+SDF Meta--environment, a programming environment generator tool based on algebraic specification. TransLog supports the interactive transformation of (a part of) a program by means of buttons representing transformation rules. This report contains the complete annotated algebraic specification of TransLog. Keywords: logic programming, algebraic specification, program transformations. 1 Introduction The subject of program transformation deals with transforming a simple-but-inefficient program into a more efficient program. An initial program P 0 is modified by applying a sequence of well-defined transformation rules, resulting...
456.
Critical Factors in the Evolution of Logic Programming and Prolog
- Ken Darby-dowman; James Little; Ub Ph
: Logic Programming has received much critical attention over the past two decades from both a language perspective and as a methodology for practical problem solving. This paper presents the logical and historical foundations of the approach and examines the development of Prolog since its first implementation. An analysis of the use of Prolog in commercial, research and teaching environments shows that there is an established base of users and that, after a period of rapid growth, the language currently has a slowly rising profile. The key to its success so far, is due to its continuing evolvement through the...
457.
Efficient Description Logic Reasoning in Prolog: The DLog system
- Gergely Lukácsy; Péter Szeredi
Traditional algorithms for description logic (DL) instance retrieval are inefficient for large amounts of underlying data. As description logic is becoming popular in areas such as the Semantic Web and information integration, it is very important to have systems that can reason efficiently over large data sets. In this paper we present an approach to transform description logic axioms described in the SHIQ DL language into a Prolog program. This transformation is done without any knowledge on the particular individuals: they are accessed dynamically during the normal Prolog execution of the generated program. This technique, together with the top-down Prolog...
458.
A Logic for Conditional Possibility
- Churn-jung Liau
this paper, we will propose a logic for
conditional possibility(LCP) that can serve the purpose.
2 The Logic LCP
459.
Logical Foundations and Implementation of an Extension of Temporal Logic
- Cobo, María Laura; Augusto, Juan Carlos
The need of counting with the appropiate management of situations involving time an the motion of change, has been reconized as an important aspect in many Computer Science areas. This fact has made evident the need of tools to handle this kind of imformation. As a reflection of this relevance many temporal logic programming languages have been propose in the last few years. In particular, wel will present here a temporal logic programming called ETP. This language is based on the proposal prsented by Gabbay in (Gab87). The present article concerns the explanation of its logical foundations and the most...
460.
ASSAT : computing answer sets of a logic program by SAT solvers
- Lin, Fangzhen; Zhao, Yuting
We propose a new translation from normal logic programs with constraints under the answer set semantics to propositional logic. Given a logic program, we show that by adding, for each loop in the program, a corresponding loop formula to the programs completion, we obtain a one-to-one correspondence between the answer sets of the program and the models of the resulting propositional theory. Compared with the translation by Ben-Eliyahu and Dechter, ours has the advantage that it does not use any extra variables, and is considerably simpler, thus easier to understand. However, in the worst case, it requires computing exponential number...
