This volume contains the Regular Papers, Technical Communications and the Doctoral Consortium papers of the 35th International Conference on logic programming (ICLP 2019), held in Las Cruces, New Mexico, USA, from Sep...
详细信息
Autonomous intelligent agents are playing increasingly important roles in our lives. They contain information about us and start to perform tasks on our behalves. Chatbots are an example of such agents that need to en...
详细信息
In this work, we show that both logic programming and abstract argumentation frameworks can be interpreted in terms of Nelson's constructive logic N4. We do so by formalising, in this logic, two principles that we...
详细信息
ISBN:
(纸本)9781577358039
In this work, we show that both logic programming and abstract argumentation frameworks can be interpreted in terms of Nelson's constructive logic N4. We do so by formalising, in this logic, two principles that we call non-contradictory inference and strengthened closed world assumption: the first states that no belief can be held based on contradictory evidence while the later forces both unknown and contradictory evidence to be regarded as false. Using these principles, both logic programming and abstract argumentation frameworks are translated into constructive logic in a modular way and using the object language. logic programming implication and abstract argumentation supports become, in the translation, a new implication connective following the non-contradictory inference principle. Attacks are then represented by combining this new implication with strong negation.
This dissertation presents an investigation of logic programming based on intensional logic. Through intensional logic, the notion of dynamic change and the ability to reason about context-dependent properties can be ...
详细信息
This dissertation presents an investigation of logic programming based on intensional logic. Through intensional logic, the notion of dynamic change and the ability to reason about context-dependent properties can be brought back into logic programming without any extra-logical or non-logical features. In intensional logic, the meaning of an expression depends on an implicit context. Temporal logic is a special case of intensional logic where the set of contexts models a collection of moments in time. Intensional logic programs are a set of logical axioms interpreted as statements true at all contexts. We can investigate the meaning of programs written in an intensional language either by focusing on the language or by studying the general properties of intensional logic programming to identify the conditions under which those properties are satisfied. This dissertation discusses both approaches with more emphasis on the more general one. The temporal language Chronolog is an instance of intensional logic programming, suitable for modeling time-varying aspects of certain problems and non-terminating computations. The semantics of Chronolog programs are developed in terms of temporal Herbrand interpretations. The dissertation introduces an intensional semantics based on Scott's neighborhood semantics. We identify several important semantic properties of intensional operators, namely, monotonicity, universality, conjunctivity and finitariness. An intensional logic program logic enjoys the minimum model semantics and its fixpoint characterization provided that intensional operators of the underlying logic have these properties. We show that the theory can be applied to existing logic programming languages based on diverse temporal logics, modal logic and interval logic. The theory can be utilized to design an intensional logic programming language with the desired properties. Due to non-determinism involved in logic programming, predicates do not represent single-value
The compliance verification task amounts to establishing if the execution of a system, given in terms of observed happened events, does respect a given property. In the past both the frameworks of Temporal logics and ...
详细信息
Events have effects on properties of the world;they initiate or terminate these properties at a given point in time. Reasoning about events and their e ects comes naturally to us and appears to be simple, but it is ac...
详细信息
Here, we present a family of complete interleaving depth-first search strategies for embedded, domain-specific logic languages. We derive our search family from a stream-based implementation of incomplete depth-first ...
详细信息
Similarity relations are used in several fuzzy logic programming environments like FLOPER, which has been developed in our research group along the last decade. Strongly connected with this system, in this paper we sh...
详细信息
logic programming is a logic-based programming paradigm, and provides languages for declarative problem solving and symbolic reasoning. In this paper, we develop new algorithms for computing logic programming semantic...
详细信息
In this Master's thesis the author's aim is to give model building tools for the tem- poral paraconsistent logic program called Before-After Extended Vector Annotated logic Program with Strong Negation (bf-EVA...
详细信息
In this Master's thesis the author's aim is to give model building tools for the tem- poral paraconsistent logic program called Before-After Extended Vector Annotated logic Program with Strong Negation (bf-EVALPSN), originally created by Profes- sor Kazumi Nakamatsu of the Prefectural University of Hyogo, Japan. The tools bridge the paraconsistent logic program language with finite state automata.
暂无评论