In the logic programming paradigm, a program is defined by a set of methods, each of which can be executed when specific conditions are met during the current state of an execution. The semantics of these programs can...
详细信息
In the logic programming paradigm, a program is defined by a set of methods, each of which can be executed when specific conditions are met during the current state of an execution. The semantics of these programs can be elegantly represented using sequent calculi, in which each method is linked to an inference rule. In this context, proof search mirrors the program's execution. Previous works introduced a framework in which the process of constructing proof nets is employed to model executions, as opposed to the traditional approach of proof search in sequent calculus. This paper further extends this investigation by focussing on the pure multiplicative fragment of this framework. We demonstrate, providing practical examples, the capability to define logic programming methods with context-sensitive behaviors solely through specific resource-preserving and context-free operations, corresponding to certain generalized multiplicative connectives explored in existing literature. We show how some of these methods, although still multiplicative, escape the purely multiplicative fragment of Linear logic (MLL, containing only ` and circle times).
This paper summarizes our investigation on the application of LP-based reasoning to machine ethics, a field that emerges from the need of imbuing autonomous agents with the capacity for moral decision-making. We ident...
详细信息
ISBN:
(纸本)9783319234854;9783319234847
This paper summarizes our investigation on the application of LP-based reasoning to machine ethics, a field that emerges from the need of imbuing autonomous agents with the capacity for moral decision-making. We identify morality viewpoints (concerning moral permissibility and the dual-process model) as studied in moral philosophy and psychology, which are amenable to computational modeling. Subsequently, various LP-based reasoning features are applied to model these identified morality viewpoints, via classic moral examples taken off-the-shelf from the literature.
Multiagent planning deals with the problem of generating plans for multiple agents. It requires formalizing ways for the agents to interact and cooperate, in order to achieve their goals. One way for the agents to int...
详细信息
ISBN:
(纸本)9783642028458
Multiagent planning deals with the problem of generating plans for multiple agents. It requires formalizing ways for the agents to interact and cooperate, in order to achieve their goals. One way for the agents to interact is through negotiations. Integration of negotiation in multiagent planning has not been extensively investigated and a systematic way for this task has yet to be found. We develop a generic model for negotiation in dynamic environments and apply it to generate joint-plans with negotiation for multiple agents. We identify the minimal requirements for such a model and propose a general scheme for one-to-one negotiations. This model of negotiation is instantiated to deal with dynamic knowledge of planning agents. We demonstrate how logic programming can be employed as a uniform platform to support both planning and negotiation, providing an ideal testbed for experimenting with multiagent planning with negotiations.
logic programming emerged in the 1970s from debates concerning procedural versus declarative representations of knowledge in artificial intelligence. In those days, declarative representations were associated mainly w...
详细信息
ISBN:
(纸本)9783642405648
logic programming emerged in the 1970s from debates concerning procedural versus declarative representations of knowledge in artificial intelligence. In those days, declarative representations were associated mainly with bottom-up proof procedures, such as hyper-resolution. The development of logic programming showed that procedural representations could be obtained by applying top-down proof procedures, such as linear resolution, to declarative representations in logical form. In recent years, logic programming has become more purely declarative, with the development of answer set programming, tabling and the revival of data-log. These recent developments invite comparison with earlier attempts to reconcile procedural and declarative representations of knowledge, and raise the question whether anything has been lost.
logic programming and Argumentation Theory have been existing side by side as two separate, yet related, techniques in the field of Knowledge Representation and Reasoning for many years. When Assumption-Based Argument...
详细信息
ISBN:
(纸本)9781577357001
logic programming and Argumentation Theory have been existing side by side as two separate, yet related, techniques in the field of Knowledge Representation and Reasoning for many years. When Assumption-Based Argumentation (ABA) was first introduced in the nineties, the authors showed how a logic program can be encoded in an ABA framework and proved that the stable semantics of a logic program corresponds to the stable extension semantics of the ABA framework encoding this logic program. We revisit this initial work by proving that the 3-valued stable semantics of a logic program coincides with the complete semantics of the encoding ABA framework, and that the L-stable semantics of this logic program coincides with the semi-stable semantics of the encoding ABA framework. Furthermore, we show how to graphically represent the structure of a logic program encoded in an ABA framework and that not only logic programming and ABA semantics but also Abstract Argumentation semantics can be easily applied to a logic program using these graphical representations.
This reply to Oaksford and Chater's (O&C)'s critical discussion of our use of logic programming (LP) to model and predict patterns of conditional reasoning will frame the dispute in terms of the semantics ...
详细信息
This reply to Oaksford and Chater's (O&C)'s critical discussion of our use of logic programming (LP) to model and predict patterns of conditional reasoning will frame the dispute in terms of the semantics of the conditional. We begin by outlining some common features of LP and probabilistic conditionals in knowledge-rich reasoning over long-term memory knowledge bases. For both, context determines causal strength;there are inferences from the absence of certain evidence;and both have analogues of the Ramsey test. Some current work shows how a combination of counting defeaters and statistics from network monitoring can provide the information for graded responses from LP reasoning. With this much introduction, we then respond to O&C's specific criticisms and misunderstandings.
The deep symmetry of linear logic [18] makes it suitable for providing abstract models of computation, free from implementation details which are, by nature, oriented and non-symmetrical. I propose here one such model...
详细信息
This note provides background information and references to the tutorial on recent research developments in logic programming inspired by needs of knowledge representation.
ISBN:
(纸本)9783540746089
This note provides background information and references to the tutorial on recent research developments in logic programming inspired by needs of knowledge representation.
The functional programming language LML (for logical Meta-Language) is presented. Like most trendy representatives of its category, LML is a higher-order, pattern-matched, polymorphically-typed, non-strict functional ...
详细信息
We characterize situations as constraints on sensor readings expressed in rules. We also introduce an extension of Prolog which we call logicCAP for programming context-aware applications, where situations are first-c...
详细信息
ISBN:
(纸本)0769521002
We characterize situations as constraints on sensor readings expressed in rules. We also introduce an extension of Prolog which we call logicCAP for programming context-aware applications, where situations are first-class entities. The operator "in-situation" in the language captures a common form of reasoning in context-aware applications, which is to ask if an entity is in a given situation. We show the usefulness of our approach via programming idioms, including defining relations among situations and integration with the Web.
暂无评论