By Dov Gabbay (auth.), Michael Fisher, Leon van der Torre, Mehdi Dastani, Guido Governatori (eds.)

This booklet constitutes the court cases of the thirteenth foreign Workshop on Computational common sense in Multi-Agent platforms, CLIMA XIII, held in Montpellier, France, in August 2012. The eleven typical papers have been rigorously reviewed and chosen from 27 submissions and offered with 3 invited papers. the aim of the CLIMA workshops is to supply a discussion board for discussing innovations, in keeping with computational good judgment, for representing, programming and reasoning approximately brokers and multi-agent structures in a proper way.

Show description

Read or Download Computational Logic in Multi-Agent Systems: 13th International Workshop, CLIMA XIII, Montpellier, France, August 27-28, 2012. Proceedings PDF

Best logic books

Statistical Estimation of Epidemiological Risk (Statistics in Practice)

Statistical Estimation of Epidemiological Risk provides assurance of crucial epidemiological indices, and contains contemporary advancements within the field. A useful reference resource for biostatisticians and epidemiologists operating in illness prevention, because the chapters are self-contained and have quite a few genuine examples.

An Invitation to Formal Reasoning

This paintings introduces the topic of formal common sense when it comes to a process that's "like syllogistic logic". Its method, like outdated, conventional syllogistic, is a "term logic". The authors' model of common sense ("term-function logic", TFL) stocks with Aristotle's syllogistic the perception that the logical kinds of statements which are thinking about inferences as premises or conclusions may be construed because the results of connecting pairs of phrases through a logical copula (functor).

Extra info for Computational Logic in Multi-Agent Systems: 13th International Workshop, CLIMA XIII, Montpellier, France, August 27-28, 2012. Proceedings

Example text

21. e x ¯ z¯ x z z x e Fig. 22. 21 22 D. Gabbay We can also write directly equations for Figure 21, as proposed in Example 7: x = 1 − max(1 − z) = z z = 1 − max(1 − x) = x. Note the following: 1. Common sense requires a solution of two extensions, either both x and z are in or both x and z are out. 2. the equational approach, as well as the situation in Figure 22, do give such two solutions: φ and {x, z}. The coalition approach of Caryol and Lagasquie-Schiex (Definition 5) give only one extension, namely {x, z}.

Definition 2. LAg is a first-order many-sorted language and contains the following sorts: – ST : the sort representing time instants. – SF : the sort representing formulas from Lbasic and from LAg itself. We use different letters for variables of different sorts: – t, t1 , t2 , . . for variables of sort ST – x, x1 , x2 , . . for variables of sort SF F (LAg ) is the set of syntactically valid formulas of LAg , which contains F (Lbasic ) and the formulas obtained by the standard syntax of first-order logic, that includes the predicate symbols and constants that will be defined below.

For instance, B(3, rain(Barcelona) ) indicates intuitively that the agent believes at time 3 that it rains in Barcelona. – G(ST , SF ) - Goal predicate: It represents a goal of the agent at a given time. For instance, G(5, run away(home) ) indicates that at time 5, the agent holds a goal to run away from home. Definition 3. LBG is a first-order many-sorted language that contains the same sorts, constant symbols and predicate symbols as LAg , and includes two new predicate symbols: – Fb (ST , SF , SF ) - Belief-supporting belief: It represents a supporting set of beliefs that hold in a given time.

Download PDF sample

Rated 4.68 of 5 – based on 35 votes