There is, I think, something ethereal about i —the square root of minus one. I remember first hearing about it at school. It seemed an odd beast at that time—an intruder hovering on the edge of reality.

Usually familiarity dulls this sense of the bizarre, but in the case of i it was the reverse: over the years the sense of its surreal nature intensified. It seemed that it was impossible to write mathematics that described the real world in …

I and i

In this provocative book, Barwise and Perry tackle the slippery subject of \"meaning, \" a subject that has long vexed linguists, language philosophers, and logicians.

/pdf/situations-and-attitudes-57f065zg2d.pdf

Situations and Attitudes.

Explaining language change: an evolutionary approach

A Combinatory Logic

Thank you for reading proofs and refutations the logic of mathematical discovery. Maybe you have knowledge that, people have search hundreds times for their chosen books like this proofs and refutations the logic of mathematical discovery, but end up in malicious downloads. Rather than enjoying a good book with a cup of coffee in the afternoon, instead they cope with some infectious bugs inside their desktop computer.

Proofs And Refutations The Logic Of Mathematical Discovery

In order to analyse the semantics of natural language sentences a translation into a partial type logic using lexical and logical combinators is presented. The sentences cover a fragment of English with propositional attitudes like knowledge, belief and assertion. A combinator is a closed term of the lambda calculus possibly containing lexical and/or logical constants. Such combinators seem promising from both a cognitive and computational point of view. There is approximately one lexical combinator for each word, but just eleven logical combinators for the present fragment. The partiality is only used for embedded sentences expressing propositional attitudes, thereby allowing for inconsistency without explosion (also called paraconsistency), and is based on a few key equalities for the connectives giving four truth values (truth, falsehood, and undefinedness with negative and positive polarity; only the first truth value is designated, i.e. yields the logical truths).

Combinators for Paraconsistent Attitudes

We provide a detailed description of the Jason-DTU system, including the used methodology, tools as well as team strategy. We also discuss the experience gathered in the contest. In spring 2009 the course "Artificial Intelligence and Multi-Agent Systems" was held for the first time on the Technical University of Denmark (DTU). A part of this course was a short introduction to the multi-agent framework Jason, which is an interpreter for AgentSpeak, an agent-oriented programming language. As the final project in this course a solution to the Multi-Agent Programming Contest from 2007, the Gold Miners scenario, was implemented. Finally we decided to participate in this year's contest with an implementation made in Jason as well.

Building multi-agent systems using Jason

We certify in the proof assistant Isabelle/HOL the soundness of a declarative first-order prover with equality. The LCF-style prover is a translation we have made, to Standard ML, of a prover in John Harrison’s Handbook of Practical Logic and Automated Reasoning. We certify it by replacing its kernel with a certified version that we program, certify and generate code from; all in Isabelle/HOL. In a declarative proof each step of the proof is declared, similar to the sentences in a thorough paper proof. The prover allows proofs to mix the declarative style with automatic theorem proving by using a tableau prover. Our motivation is teaching how automated and declarative provers work and how they are used. The prover allows studying concrete code and a formal verification of correctness. We show examples of proofs and how they are made in the prover. The entire development runs in Isabelle’s ML environment as an interactive application or can be used standalone in OCaml or Standard ML (or in other functional programming languages like Haskell and Scala with some additional work).

/pdf/programming-and-verifying-a-declarative-first-order-prover-3hrdiwsdes.pdf

Programming and verifying a declarative first-order prover in Isabelle/HOL

Open systems are characterized by a diversity of heterogeneous and autonomous agents that act according to private goals, and with a behavior that is hard to predict. They can be regulated through organizations similar to human organizations, which regulate the agents' behavior space and describe the expected behavior of the agents. Agents need to be able to reason about the regulations, so that they can act within the expected boundaries and work towards the objectives of the organization. In this paper, we propose the AORTA1 architecture for making agents organization-aware. It is designed such that it provides organizational reasoning capabilities to agents implemented in existing agent programming languages without being tied to a specific organizational model. We show how it can be integrated in the Jason agent programming language, and discuss how the agents can coordinate their organizational tasks using AORTA.

/pdf/the-aorta-architecture-integrating-organizational-reasoning-1mesprzlz3.pdf

The AORTA Architecture: Integrating Organizational Reasoning in Jason

We describe the approach used to develop the multi-agent system of herders that competed as the Jason-DTU team at the Multi-Agent Programming Contest 2010. We also participated in 2009 with a system developed in the agent-oriented programming language Jason which is an extension of AgentSpeak. We used the implementation from 2009 as a foundation and therefore much of the work done this year was on improving that implementation. We present a description which includes design and analysis of the system as well as the main features of our agent team strategy. In addition we discuss the technologies used to develop this system as well as our future goals in the area.

Jørgen Villadsen

Papers

Combinators for Paraconsistent Attitudes

Building multi-agent systems using Jason

Programming and verifying a declarative first-order prover in Isabelle/HOL

The AORTA Architecture: Integrating Organizational Reasoning in Jason

Improving multi-agent systems using Jason