Though many kinds of multi-agent systems based on argumentation have been proposed where only rule-based knowledge is taken into account, they have been unable to handle the ontological knowledge so far. In our daily life, however, there are a lot of human argumentation where both ontological and rule knowledges are used. For example, in e-commerce, a seller and a buyer usually use ontologies about products along with their respective strategic rules for buying and selling. Recent (...) progress of the Semantic Web technology provides expressive ontology languages. In this paper, we demonstrate integration of the Semantic Web reasoning and argument-based reasoning. We have implemented the integrated system such that Logic of Multiple-valued Argumentation-based agent system (specialized to two values { f, t }) can be accessible to the Semantic Web reasoning established as the description logic reasoning system, given ontologies expressed by OWL DL or its notational variant the DL SHOIN (D). An interesting argumentation result using both ontologies and rules about the university curriculum is shown as an example executed by our system. (shrink)

A fundamental interoperability problem is caused by the semantic heterogeneity of agents'ontologies in open multi-agent systems. In this paper, we propose a formal framework for agents debating over heterogeneous terminologies. For this purpose, we propose an argumentation-based representation framework to manage conflicting descriptions. Moreover, we propose a model for the reasoning of agents where they justify the description to which they commit and take into account the description of their interlocutors. Finally, we provide a dialectical (...) system allowing agents to participate in a dialogue in order to reach an agreement over heterogeneous descriptions. (shrink)

Formal ontologies are nowadays widely considered a standard tool for knowledge representation and reasoning in the Semantic Web. In this context, they are expected to play an important role in helping automated processes to access information. Namely: they are expected to provide a formal structure able to explicate the relationships between different concepts/terms, thus allowing intelligent agents to interpret, correctly, the semantics of the web resources improving the performances of the search technologies. Here we take into account a problem (...) regarding Knowledge Representation in general, and ontology based representations in particular; namely: the fact that knowledge modeling seems to be constrained between conflicting requirements, such as compositionality, on the one hand and the need to represent prototypical information on the other. In particular, most common sense concepts seem not to be captured by the stringent semantics expressed by such formalisms as, for example, Description Logics (which are the formalisms on which the ontology languages have been built). The aim of this work is to analyse this problem, suggesting a possible solution suitable for formal ontologies and semantic web representations. The questions guiding this research, in fact, have been: is it possible to provide a formal representational framework which, for the same concept, combines both the classical modelling view (accounting for compositional information) and defeasible, prototypical knowledge ? Is it possible to propose a modelling architecture able to provide different type of reasoning (e.g. classical deductive reasoning for the compositional component and a non monotonic reasoning for the prototypical one)? We suggest a possible answer to these questions proposing a modelling framework able to represent, within the semantic web languages, a multilevel representation of conceptual information, integrating both classical and non classical (typicality based) information. Within this framework we hypothesise, at least in principle, the coexistence of multiple reasoning processes involving the different levels of representation. (shrink)

This work introduces a formal framework for the social acquisition of ontologies which are constructed dynamically from overhearing the possibly conflicting symbolic interaction of autonomous information sources, and an approach to the pragmatics of communicated ontological axioms. Technically, the framework is based on distributed variants of description logic for the formal contextualization of statements w.r.t. their respective provenance, speaker's attitude, addressees, and subjective degree of confidence. Doing so, our approach demarcates from the dominating more or less informal (...) approaches to context and provenance representation on the semantic web, and carefully distinguishes between communication attitudes such as public assertion and intention exhibited on the (semantic) web on the one hand, and mental attitudes such as private belief on the other. Furthermore, our framework provides formal means for the probabilistic fusion of controversial opinions, and presents a semantics of information publishing acts. Our approach provides an incomplex and genuinely social approach to knowledge acquisition and representation, and is thus expected to be widely applicable in fields such as the semantic web and social software, and possibly also in other distributed environments such as P2P systems. (shrink)

Selfish, dishonest or malicious agents may find an interest in manipulating others. While many works deal with designing robust systems or manipulative strategies, few works are interested in defining in a broad sense what is a manipulation and how we can reason with such a notion. In this article, based on a social science literature, we give a general definition of manipulation for multi-agent systems. A manipulation is a deliberate effect of an agent – called manipulator – to (...) instrumentalize another agent – called victim – while making sure to conceal that effect. We present then a logical framework, called KBE, to express and reason about manipulations. Since manipulation relies on deliberate effects, KBE introduces a deliberate BIAT operator which abstracts deliberate consequences of actions. We prove that this logic is sound and complete. Furthermore,we express related notions such as coercion, persuasion, or deception. (shrink)

Since e-Commerce has become a discipline, e-Contracts are acknowledged as the tools that will assure the safety and robustness of the transactions. A typical e-Contract is a binding agreement between parties that creates relations and obligations. It consists of clauses that address specific tasks of the overall procedure which can be represented as workflows. Similarly to e-Contracts, Intelligent Agents manage a private policy, a set of rules representing requirements, obligations and restrictions, additionally to personal data that meet their user’s interests. (...) In this context, this study aims at proposing a policy-based e-Contract workflow management methodology that can be used by semantic web agents, since agents benefit from Semantic Web technologies for data and policy exchanges, such as RDF and RuleML that maximize interoperability among parties. Furthermore, this study presents the integration of the above methodology into a multi-agent knowledge-based framework in order to deal with issues related to rules exchange where no common syntax is used, since this framework provides reasoning services that assist agents in interpreting the exchanged policies. Finally, a B2C e-Commerce scenario is presented that demonstrates the added value of the approach. (shrink)

Infonorma is a multi-agent system that provides its users with recommendations of legal normative instruments they might be interested in. The Filter agent of Infonorma classifies normative instruments represented as Semantic Web documents into legal branches and performs content-based similarity analysis. This agent, as well as the entire Infonorma system, was modeled under the guidelines of MAAEM, a software development methodology for multi-agent application engineering. This article describes the Infonorma requirements specification, the architectural design solution for (...) those requirements, the detailed design of the Filter agent and the implementation model of Infonorma, according to the guidelines of the MAAEM methodology. (shrink)

In the last years, the vision of the Semantic Web fostered the interest in reasoning over large and very large sets of assertional statements in knowledge bases. Traditional tableau-based reasoning...

Reasoning and change over inconsistent knowledge bases is of utmost relevance in areas like medicine and law. Argumentation may bring the possibility to cope with both problems. Firstly, by constructing an argumentation framework from the inconsistent KB, we can decide whether to accept or reject a certain claim through the interplay among arguments and counterarguments. Secondly, by handling dynamics of arguments of the AF, we might deal with the dynamics of knowledge of the underlying inconsistent KB. Dynamics of arguments has (...) recently attracted attention and although some approaches have been proposed, a full axiomatization within the theory of belief revision was still missing. A revision arises when we want the argumentation semantics to accept an argument. Argument Theory Change encloses the revision operators that modify the AF by analyzing dialectical trees—arguments as nodes and attacks as edges—as the adopted argumentation semantics. In this article, we present a simple approach to ATC based on propositional KBs. This allows to manage change of inconsistent KBs by relying upon classical belief revision, although contrary to it, consistency restoration of the KB is avoided. Subsequently, a set of rationality postulates adapted to argumentation is given, and finally, the proposed model of change is related to the postulates through the corresponding representation theorem. Though we focus on propositional logic, the results can be easily extended to more expressive formalisms such as first-order logic and description logics, to handle evolution of ontologies. (shrink)

Ontology languages for the Semantic Web have their strengths and weaknesses, in particular in the light of deploying them for biological and medical information systems. We survey and compare the Description Logics-based OWL languages, and the DL-Lite and DLR families of languages. Language choices that an ontology developer has to make are, among others, expressivity with n-ary relations (where n > 2) and more role properties versus ontology usage for data-intensive tasks. Guidelines are suggested to facilitate choosing (...) the language best fitted for a task. (shrink)

This paper proposes a semantic description of the linear step-like temporal multi-agent logic with the universal modality \(\mathcal{LTK}.sl_U\) based on the idea of non-reflexive non-transitive nature of time. We proved a finite model property and projective unification for this logic.

In this work, we propose a meaningful extension of description logics for non-monotonic reasoning. We introduce \, a logic allowing for the representation of and reasoning about both typical class-membership and typical instances of a relation. We propose a preferential semantics for \ in terms of partially-ordered DL interpretations which intuitively captures the notions of typicality we are interested in. We define a tableau-based algorithm for checking \ knowledge-base consistency that always terminates and we show that it is (...) sound and complete w.r.t. our preferential semantics. The general framework we here propose can serve as the foundation for further exploration of non-monotonic reasoning in description logics and similarly structured logics. (shrink)

In order to improve the management of copyright in the Internet, known as Digital Rights Management, there is the need for a shared language for copyright representation. Current approaches are based on purely syntactic solutions, i.e. a grammar that defines a rights expression language. These languages are difficult to put into practise due to the lack of explicit semantics that facilitate its implementation. Moreover, they are simple from the legal point of view because they are intended just to model (...) the usage licenses granted by content providers to end-users. Thus, they ignore the copyright framework that lies behind and the whole value chain from creators to end-users. Our proposal is to use a semantic approach based on semantic web ontologies. We detail the development of a copyright ontology in order to put this approach into practice. It models the copyright core concepts for creation, rights and the basic kinds of actions that operate on content. Altogether, it allows building a copyright framework for the complete value chain. The set of actions operating on content are our smaller building blocks in order to cope with the complexity of copyright value chains and statements and, at the same time, guarantee a high level of interoperability and evolvability. The resulting copyright modelling framework is flexible and complete enough to model many copyright scenarios, not just those related to the economic exploitation of content. The ontology also includes moral rights, so it is possible to model this kind of situations as it is shown in the included example model for a withdrawal scenario. Finally, the ontology design and the selection of tools result in a straightforward implementation. Description Logic reasoners are used for license checking and retrieval. Rights are modelled as classes of actions, action patterns are modelled also as classes and the same is done for concrete actions. Then, to check if some right or license grants an action is reduced to check for class subsumption, which is a direct functionality of these reasoners. (shrink)

A model of normative provisions and related axioms represented by using RDF/owl are presented as a contribution to implement the semantic web in the legal domain. In particular, a pattern able to implement the Hohfeldian legal fundamental relations between provisions using OWL-DL expressivity is proposed. Moreover, a query-based approach able to deal with relations between provision instances is described. An example of advanced access and reasoning over provisions using the proposed approach, as well as a prototype architecture of (...) a provision retrieval system, are shown. The main benefit is represented by the ability of the approach to keep the complexity of the problem within a description logic computational tractability. (shrink)

Modal logics, originally conceived in philosophy, have recently found many applications in computer science, artificial intelligence, the foundations of mathematics, linguistics and other disciplines. Celebrated for their good computational behaviour, modal logics are used as effective formalisms for talking about time, space, knowledge, beliefs, actions, obligations, provability, etc. However, the nice computational properties can drastically change if we combine some of these formalisms into a many-dimensional system, say, to reason about knowledge bases developing in time or moving objects. To study (...) the computational behaviour of many-dimensional modal logics is the main aim of this book. On the one hand, it is concerned with providing a solid mathematical foundation for this discipline, while on the other hand, it shows that many seemingly different applied many-dimensional systems (e.g., multi-agent systems, description logics with epistemic, temporal and dynamic operators, spatio-temporal logics, etc.) fit in perfectly with this theoretical framework, and so their computational behaviour can be analyzed using the developed machinery. We start with concrete examples of applied one- and many-dimensional modal logics such as temporal, epistemic, dynamic, description, spatial logics, and various combinations of these. Then we develop a mathematical theory for handling a spectrum of 'abstract' combinations of modal logics - fusions and products of modal logics, fragments of first-order modal and temporal logics - focusing on three major problems: decidability, axiomatizability, and computational complexity. Besides the standard methods of modal logic, the technical toolkit includes the method of quasimodels, mosaics, tilings, reductions to monadic second-order logic, algebraic logic techniques. Finally, we apply the developed machinery and obtained results to three case studies from the field of knowledge representation and reasoning: temporal epistemic logics for reasoning about multi-agent systems, modalized description logics for dynamic ontologies, and spatio-temporal logics. The genre of the book can be defined as a research monograph. It brings the reader to the front line of current research in the field by showing both recent achievements and directions of future investigations (in particular, multiple open problems). On the other hand, well-known results from modal and first-order logic are formulated without proofs and supplied with references to accessible sources. The intended audience of this book is logicians as well as those researchers who use logic in computer science and artificial intelligence. More specific application areas are, e.g., knowledge representation and reasoning, in particular, terminological, temporal and spatial reasoning, or reasoning about agents. And we also believe that researchers from certain other disciplines, say, temporal and spatial databases or geographical information systems, will benefit from this book as well. Key Features: Integrated approach to modern modal and temporal logics and their applications in artificial intelligence and computer science Written by internationally leading researchers in the field of pure and applied logic Combines mathematical theory of modal logic and applications in artificial intelligence and computer science Numerous open problems for further research Well illustrated with pictures and tables. (shrink)

Since the time of Aristotle's students, interpreters have considered Prior Analytics to be a treatise about deductive reasoning, more generally, about methods of determining the validity and invalidity of premise-conclusion arguments. People studied Prior Analytics in order to learn more about deductive reasoning and to improve their own reasoning skills. These interpreters understood Aristotle to be focusing on two epistemic processes: first, the process of establishing knowledge that a conclusion follows necessarily from a set of premises (that is, on the (...) epistemic process of extracting information implicit in explicitly given information) and, second, the process of establishing knowledge that a conclusion does not follow. Despite the overwhelming tendency to interpret the syllogistic as formal epistemology, it was not until the early 1970s that it occurred to anyone to think that Aristotle may have developed a theory of deductive reasoning with a well worked-out system of deductions comparable in rigor and precision with systems such as propositional logic or equational logic familiar from mathematical logic. When modern logicians in the 1920s and 1930s first turned their attention to the problem of understanding Aristotle's contribution to logic in modern terms, they were guided both by the Frege-Russell conception of logic as formal ontology and at the same time by a desire to protect Aristotle from possible charges of psychologism. They thought they saw Aristotle applying the informal axiomatic method to formal ontology, not as making the first steps into formal epistemology. They did not notice Aristotle's description of deductive reasoning. Ironically, the formal axiomatic method (in which one explicitly presents not merely the substantive axioms but also the deductive processes used to derive theorems from the axioms) is incipient in Aristotle's presentation. Partly in opposition to the axiomatic, ontically-oriented approach to Aristotle's logic and partly as a result of attempting to increase the degree of fit between interpretation and text, logicians in the 1970s working independently came to remarkably similar conclusions to the effect that Aristotle indeed had produced the first system of formal deductions. They concluded that Aristotle had analyzed the process of deduction and that his achievement included a semantically complete system of natural deductions including both direct and indirect deductions. Where the interpretations of the 1920s and 1930s attribute to Aristotle a system of propositions organized deductively, the interpretations of the 1970s attribute to Aristotle a system of deductions, or extended deductive discourses, organized epistemically. The logicians of the 1920s and 1930s take Aristotle to be deducing laws of logic from axiomatic origins; the logicians of the 1970s take Aristotle to be describing the process of deduction and in particular to be describing deductions themselves, both those deductions that are proofs based on axiomatic premises and those deductions that, though deductively cogent, do not establish the truth of the conclusion but only that the conclusion is implied by the premise-set. Thus, two very different and opposed interpretations had emerged, interestingly both products of modern logicians equipped with the theoretical apparatus of mathematical logic. The issue at stake between these two interpretations is the historical question of Aristotle's place in the history of logic and of his orientation in philosophy of logic. This paper affirms Aristotle's place as the founder of logic taken as formal epistemology, including the study of deductive reasoning. A by-product of this study of Aristotle's accomplishments in logic is a clarification of a distinction implicit in discourses among logicians--that between logic as formal ontology and logic as formal epistemology. (shrink)

This paper introduces a multi-agent dynamic epistemic logic for abstract argumentation. Its main motivation is to build a general framework for modelling the dynamics of a debate, which entails reasoning about goals, beliefs, as well as policies of communication and information update by the participants. After locating our proposal and introducing the relevant tools from abstract argumentation, we proceed to build a three-tiered logical approach. At the first level, we use the language of propositional logic to encode states of (...) a multi-agent debate. This language allows to specify which arguments any agent is aware of, as well as their subjective justification status. We then extend our language and semantics to that of epistemic logic, in order to model individuals’ beliefs about the state of the debate, which includes uncertainty about the information available to others. As a third step, we introduce a framework of dynamic epistemic logic and its semantics, which is essentially based on so-called event models with factual change. We provide completeness results for a number of systems and show how existing formalisms for argumentation dynamics and unquantified uncertainty can be reduced to their semantics. The resulting framework allows reasoning about subtle epistemic and argumentative updates—such as the effects of different levels of trust in a source—and more in general about the epistemic dimensions of strategic communication. (shrink)

In a multiagent and multi-cultural world, the fine-grained analysis of agents’ dynamic behaviour, i.e. of their activities, is essential. Dynamic activities are actions that are characterized by an agent who executes the action and by other participants of the action. Wh-questions on the participants of the actions pose a difficult particular challenge because the variability of the types of possible answers to such questions is huge. To deal with the problem, we propose the analysis and classification of Wh-questions apt (...) for agents’ communication in a multiagent system (MAS). Our proposal of such a system consists of agents who communicate with their fellow agents by messaging so that each autonomous agent, though resource-bounded, can make less or more rational decisions to meet its own and collective goals. In addition, by communicating with other fellow agents and their environment, agents can learn new concepts and enrich their ontology so that their behaviour is dynamic. We aim to make a general proposal of the system so that the ‘envelope’ of agents’ messages can be formalized in any MAS standard, be it The Foundation for Intelligent Physical Agents - Agent Communication Language (FIPA-ACL) or Knowledge Query and Manipulation Language (KQML). Yet, the content of messages is encoded in a formalized natural language. To this end, we apply Transparent Intensional Logic (TIL) with its procedural semantics which is particularly apt for a fine-grained analysis in which all the semantically salient features of natural language can be plausibly formalized. In this paper, we concentrate on analysing the content of query messages, particularly the content of those that encode Wh-questions and the answers to them. We also summarize TIL deduction system that makes it possible to answer such questions in an intelligent way. Linguists distinguish several subtypes of Wh-questions. Though the linguistic classification is helpful, it is not always suitable for agents’ communication and reasoning. We need the classification based on a logical analysis of Wh-questions so that the agents can infer possible answers to such questions rather than only looking for them by keywords. This paper aims to apply an appropriate classification of the logical types of Wh-questions and the analysis of such questions; we concentrate in particular on questions concerning the participants of activities. The application of these results to the analysis of processes and events based on verb valency frames is another novelty of the paper. (shrink)

This research employs Description Logics in order to focus on logical description and analysis of the phenomenon of ‘concept understanding’. The article will deal with a formal-semantic model for figuring out the underlying logical assumptions of ‘concept understanding’ in knowledge representation systems. In other words, it attempts to describe a theoretical model for concept understanding and to reflect the phenomenon of ‘concept understanding’ in terminological knowledge representation systems. Finally, it will design an ontology that schemes the structure (...) of concept understanding based on the proposed semantic model. (shrink)

Proof requires a dialogue between agents to clarify obscure inference steps, fill gaps, or reveal implicit assumptions in a purported proof. Hence, argumentation is an integral component of the discovery process for mathematical proofs. This work presents how argumentation theories can be applied to describe specific informal features in the development of proof-events. The concept of proof-event was coined by Goguen who described mathematical proof as a public social event that takes place in space and time. This new meta-methodological concept (...) is designed to cover not only “traditional” formal proofs but all kinds of proofs and inference steps, including incomplete or purported proofs. Our approach attempts to make proof-events more comprehensive to express the complete trajectory of a mathematical proof-event until the ultimate validation of the proving outcome. Thus, we advance an extended version of proof-event calculus which is built on argumentation theories designed to capture the internal and external structure of collaborative mathematical practice and highlight the relationship between proof, human reasoning, and cognitive processes. In addition, another area in which argumentation can make a significant contribution is dealing with the defeasible knowledge of the Web which is a product of its open and ubiquitous nature. This approach seems to be sufficient for the presentation of Web-based proving processes as manifested in the case of the Mini-Polymath 4 project. (shrink)

Argumentation is a very fertile area of research in Artificial Intelligence, and various semantics have been developed to predict when an argument can be accepted, depending on the abstract structure of its defeaters and defenders. When these semantics make conflicting predictions, theoretical arbitration typically relies on ad hoc examples and normative intuition about what prediction ought to be the correct one. We advocate a complementary, descriptive-experimental method, based on the collection of behavioral data about the way human reasoners (...) handle these critical cases. We report two studies applying this method to the case of reinstatement (both in its simple and floating forms). Results speak for the cognitive plausibility of reinstatement and yet show that it does not yield the full expected recovery of the attacked argument. Furthermore, results show that floating reinstatement yields comparable effects to that of simple reinstatement, thus arguing in favor of preferred argumentation semantics, rather than grounded argumentation semantics. Besides their theoretical value for validating and inspiring argumentation semantics, these results have applied value for developing artificial agents meant to argue with human users. (shrink)

The year 2012 has witnessed worldwide celebrations of Alan Turing’s 100th birthday. A great number of conferences and workshops were organized by logicians, computer scientists and researchers in AI, showing the continued flourishing of computer science, and the fruitful interfaces between logic and computer science. Logic is no longer just the concept that Frege had about one hundred years ago, let alone that of Aristotle twenty centuries before. One of the prominent features of contemporary logic is its interdisciplinary character, connecting (...) across mathematics, philosophy, modern computer science, and even the cognitive and social sciences. -/- China is no exception. This special issue explores interfaces of logic with AI and other disciplines, and it attempts to give a bird’s eye view of the developing landscape of logic and AI in China. Our contributors come from computer science, AI, philosophy and linguistics, united by their interest in using formal logical tools and notions to deal with substantial problems in their fields. We are aware that AI is a vast area, and that the limitations of space in a volume like this may provide a somewhat incomplete or biased view. Still we hope that the six papers selected here illustrate the concerns and curiosity driving Chinese researchers, on topics shared with our colleagues around the world. -/- One of the active research areas in AI is planning under uncertainty, with incomplete knowledge, where a well-established logical framework is the action language of Son and Baral (Son and Baral 2001). This language can express the notions of sensing actions and making conditional plans. However, its current semantics is not yet satisfactory, since according to the semantics an agent would not have knowledge of what happens after a plan is executed, which can be a serious problem in a safety-critical environment. In their paper Proof Systems for Planning under Cautious Semantics (Shen and Zhao 2013), Yuping Shen and Xishun Zhao address this problem and propose a cautious and weakly cautious semantics for the action language. This new semantics enables the agent to know exactly what happens after executing an action. Hoare style proof systems are then proposed and proved to be sound and complete. What is more, the proposed new system reduces the reasoning complexity of the action language. -/- In Preferential Semantics for Plausible Subsumption in Possibility Theory (Qi and Zhang 2013), Guilin Qi and Zhizheng Zhang investigate another important issue in AI: how to handle exceptions in a knowledge-based system. This has become a hot topic in recent years, especially in ontological design, where description logics are widely used. The question then arises whether we can get a nonmonotonic extension of description logic. To answer this, the authors first propose three preferential semantics for plausible subsumption in the framework of possibility theory (Dubois and Prade 1985) and study their properties and their relationships. Then they introduce preferential subsumptions to a description logic-based knowledge system, and define an entailment relation of plausible subsumption. Moreover, they study reductions of the new semantics to standard semantics for an expressive description logic. -/- Counterfactual reasoning has been explored extensively by philosophers, cf. Lewis (1973), Stalnaker (1968). But in the last two decades, causal models have been proposed for modeling counterfactual reasoning by researchers in AI. In A Lewisian Logic of Causal Counterfactuals (Zhang 2013), Jiji Zhang studies classes of causal models and provides formal characterizations. In particular, a new logic system is proposed and proved complete for the class of ‘Lewisian models’ satisfying all the principles of David Lewis’s logic of counterfactuals. Moreover, Zhang compares his new framework with those of Lewis and Stalnaker, and also establishes formal connections with more recent approaches by Galles and Pearl, and by Halpern. -/- Consistency is a fundamental notion in logic, but it also plays a key role in many techniques for solving constraint satisfaction problems (Mackworth 1977). In Variable-Centered Consistency in Model RB (Li et al. 2013), Liang Li, Tian Liu and Ke Xu start with a discussion of i-consistency in ‘Model RB’ and ‘Model RD’, two models of random constraint satisfaction problems with growing domain size, then compare it with the notion of t-consistency and strong t-consistency in well-known earlier work by Freuder. After that, the authors define a new kind of variable-centered consistency, and show an upper bound on a suitably chosen parameter in Model RB and Model RD, such that up to this bound, all typical instances of Model RB are variable-centered consistent. -/- Language understanding is a cognitive process that human beings carry out every day. Metaphor is a pervasive phenomenon in natural languages, and its cognitive role calls for interpretation. There is a growing body of literature on cognitive mechanisms underlying metaphor. The paper An Ontology-Based Approach to Metaphor Cognitive Computation (Huang et al. 2013) by Xiaoxi Huang, Huaxin Huang, Beishui Liao, and Cihua Xu proposes a theoretical framework for metaphor understanding based on recent results from cognitive science (Shutova 2010). They then introduce ontology as a knowledge representation method, and present a new ontological model to formalize metaphor-based knowledge. An algorithmic description is provided using a quantitative measure of integrated degree, and its effectiveness is demonstrated. -/- Puzzles and their solution mechanisms are a recurrent theme in many fields. Dynamic epistemic logic (van Ditmarsch et al. 2007); (van Benthem 2011) is a recent framework that can handle information dynamics in knowledge puzzles. In Reasoning About Agent Types and the Hardest Logic Puzzle Ever (Liu and Wang 2013), Fenrong Liu and Yanjing Wang propose a new dynamic-epistemic logic that can specify different types of agents and analyse agents’ knowledge, communication and reasoning. To demonstrate its power, Smullyan’s well-known Knights and Knaves puzzles are formalized, as well as the Hardest Logic Puzzle Ever (HLPE) of Boolos (Boolos 1996). Moreover, a spectrum of new puzzles is found involving knowledge-based agent types, and their solution complexity is shown to be harder than that for existing logic puzzles. It is also shown that a version of HLPE in which the agents do not know the others’ types does not have a solution at all. -/- Finally, we would like to thank the editor of Minds and Machines, Gregory Wheeler, for his efficient assistance and kind support. We also thank Ties Nijssen at Springer for his encouragement to start this project at the first place. And of course, our appreciation goes to our authors, as well as all the colleagues who have helped us review the papers in this collection. (shrink)

In this paper we study the semantic data complexity of several controlled fragments of English designed for natural language front-ends to OWL (Web Ontology Language) and description logic ontology-based systems. Controlled languages are fragments of natural languages, obtained by restricting natural language syntax, vocabulary and semantics with the goal of eliminating ambiguity. Semantic complexity arises from the formal logic modelling of meaning in natural language and fragments thereof. It can be characterized as the computational complexity of (...) the reasoning problems associated to their semantic representations. Data complexity (the complexity of answering a question over an ontology, stated in terms of the data items stored therein), in particular, provides a measure of the scalability of controlled languages to ontologies, since tractable data complexity implies scalability of data access. We present maximal tractable controlled languages and minimal intractable controlled languages. (shrink)

In open scenarios, agents willing to cooperate must impact the communication barrier between them and their unknown partners. If agents are not relying on any agreement about the meaning they ascribe to the symbols used in the conversation, semantic misalignments will arise on the discourse domain as well, thus making the communication impossible. In wide and heterogeneous scenarios offered by the Web (and its newborn semantic incarnation), traditional and meaning-safe methodologies for communication need to keep abreast of new (...) dynamic communicative interaction modalities. The uncertainties arising from communication between actors which base their behavior on different and heterogeneous knowledge models have to be taken into account, wisely balancing the extent of “reachable knowledge” with the trustworthiness of its information. Main objective of this work is to augment the FIPA Ontology Service Specification with linguistically-aware methodologies for communication, describing a wide-scope framework for multi-agent systems design, semantic integration and coordination. (shrink)

This original research hypothesises that the most fundamental building blocks of logical descriptions of cognitive, or knowledge, agents’ descriptions are expressible based on their conceptions (of the world). This article conceptually and logically analyses agents’ conceptions in order to offer a constructivist- based logical model for terminological knowledge. The most significant characteristic of [terminological] knowing is that there are strong interrelationships between terminological knowledge and the individualistic constructed, and to-be-constructed, models of knowledge. Correspondingly, I conceptually and logically analyse (...) conception expressions based on terminological knowledge, and I show how terminological knowledge may reasonably be assumed to be constructed based on the agents’ conceptions of the world. The focus of my model is on terminological knowledge structures, which may find applications in such diverse fields as the Semantic Web and educational/learning systems. (shrink)

This text looks at the construction of the Semantic Web, which will enable computers to automatically and independently consume Web-based information. With numerous programming examples, it is ideal for undergraduates and graduates in mathematics, computer science and logic and researchers interested in Multi-Agent Systems and the Semantic Web.

In this paper, we continued the preparatory works of Jingde Cheng in conjunction with spatio-temporal relevant logics, and proposed several epistemic spatio-temporal relevant logics as basic logics for Mobile Multi-Agent Systems (MMAS). To establish an inference system, important elements are: semantics and syntax appropriate to it include a language, axioms and inference rules. By proving the meta-logical properties such as soundness and consistency, completeness and decidability and etc., we have a method to test the reliability of the systems. Finally, (...) we will have models and algorithms for the application of these logics in the MMAS. (shrink)

In this paper we describe an approach to practical reasoning, reasoning about what it is best for a particular agent to do in a given situation, based on presumptive justifications of action through the instantiation of an argument scheme, which is then subject to examination through a series of critical questions. We identify three particular aspects of practical reasoning which distinguish it from theoretical reasoning. We next provide an argument scheme and an associated set of critical questions (...) which is able to capture these features. In order that both the argument scheme and the critical questions can be given precise interpretations we use the semantic structure of an Action-Based Alternating Transition System as the basis for their definition. We then work through a detailed example to show how this approach to practical reasoning can be applied to a problem solving situation, and briefly describe some other previous applications of the general approach. In a second example we relate our account to the social laws paradigm for co-ordinating multi-agent systems. The contribution of the paper is to provide firm foundations for an approach to practical reasoning based on presumptive argument in terms of a well-known model for representing the effects of actions of a group of agents. (shrink)

A proof-theoretical treatment of collectively accepted group beliefs is presented through a multi-agent sequent system for an axiomatization of the logic of acceptance. The system is based on a labelled sequent calculus for propositional multi-agent epistemic logic with labels that correspond to possible worlds and a notation for internalized accessibility relations between worlds. The system is contraction- and cut-free. Extensions of the basic system are considered, in particular with rules that allow the possibility of operative members or (...) legislators. Completeness with respect to the underlying Kripke semantics follows from a general direct and uniform argument for labelled sequent calculi extended with mathematical rules for frame properties. As an example of the use of the calculus we present an analysis of the discursive dilemma. (shrink)

By introducing and extending description logic (DLs) and growing up their application in knowledge representation and especially in OWLs and semantic web scope, many shortcomings and bugs were identified that weren’t resolvable in classical DLs and so logicians and computer scientists intended to non-classical and non-monotonic reasoning tools. In this paper, I discuses about abduction problem solvers, and by introducing A-Box abduction in description logics (DLs), such as ALC, discuss about decidability and complexity in different introduced algorithms, (...) and report shortly our team’s advantages in developing and implementation of ΑBox abduction in DLs. (shrink)

We draw parallels between several closely related logics that combine — in different proportions — elements of game theory, computation tree logics, and epistemic logics to reason about agents and their abilities. These are: the coalition game logics CL and ECL introduced by Pauly 2000, the alternating-time temporal logic ATL developed by Alur, Henzinger and Kupferman between 1997 and 2002, and the alternating-time temporal epistemic logic ATEL by van der Hoek and Wooldridge (2002). In particular, we establish some subsumption and (...) equivalence results for their semantics, as well as interpretation of the alternating-time temporal epistemic logic into ATL. The focus in this paper is on models: alternating transition systems, multi-player game models (alias concurrent game structures) and coalition effectivity models turn out to be intimately related, while alternating epistemic transition systems share much of their philosophical and formal apparatus. Our approach is constructive: we present ways to transform between different types of models and languages. (shrink)

Bio-ontologies are essential tools for accessing and analyzing the rapidly growing pool of plant genomic and phenomic data. Ontologies provide structured vocabularies to support consistent aggregation of data and a semantic framework for automated analyses and reasoning. They are a key component of the Semantic Web. This paper provides background on what bio-ontologies are, why they are relevant to botany, and the principles of ontology development. It includes an overview of ontologies and related resources that are relevant to (...) plant science, with a detailed description of the Plant Ontology (PO). We discuss the challenges of building an ontology that covers all green plants (Viridiplantae). Key results: Ontologies can advance plant science in four keys areas: 1. comparative genetics, genomics, phenomics, and development, 2. taxonomy and systematics, 3. semantic applications and 4. education. Conclusions: Bio-ontologies offer a flexible framework for comparative plant biology, based on common botanical understanding. As genomic and phenomic data become available for more species, we anticipate that the annotation of data with ontology terms will become less centralized, while at the same time, the need for cross-species queries will become more common, causing more researchers in plant science to turn to ontologies. (shrink)

Web legal information retrieval systems need the capability to reason with the knowledge modeled by legal ontologies. Using this knowledge it is possible to represent and to make inferences about the semantic content of legal documents. In this paper a methodology for applying NLP techniques to automatically create a legal ontology is proposed. The ontology is defined in the OWL semantic web language and it is used in a logic programming framework, EVOLP+ISCO, to allow users to query the (...) semantic content of the documents. ISCO allows an easy and efficient integration of declarative, object-oriented and constraint-based programming techniques with the capability to create connections with external databases. EVOLP is a dynamic logic programming framework allowing the definition of rules for actions and events. An application of the proposed methodology to the legal web information retrieval system of the Portuguese Attorney General’s Office is described. (shrink)

B a c k g r o u n d. The article is devoted to the analysis of the key directions of the study of the possible influence of the specifics of Chinese language culture on the content and nature of intellectual discourse, which is recognized as philosophical. Logic and ontology are the key areas of analysis of the possible influence of linguistic determinants on the intellectual discourse of China. Three main topics that attract the attention of researchers are the (...) structure of judgment, the semantics of lexical units, and the specificity of the pragmatics of the Chinese language. M e t h o d s. The author applied general scientific methods of analysis, synthesis, comparison and description of the works of researchers of Chinese philosophy, which justify and argue the fruitfulness of studying the peculiarities of Chinese language to explain the reasons of the fundamental difference between the problems actualized in the history of Chinese philosophy and those that formed the basis of the development of the history of philosophy in the Western world. R e s u l t s. It is generally accepted that for the worldview of representatives of Chinese culture, the world is a structural whole, consisting of elements that continuously interact in the dynamics of changes and transformations, we find a reflection of this feature in the semantics of the corresponding symbolic system. Polysemy in the Chinese language mostly reveals a complex and multi-layered "web" of associative and correlative connections between meanings, which in fact cannot be argued outside the context of the relevant cultural tradition indicating common features or similarities of the signified. The doubt about the typicality of understanding the denotations as fixed and atomized for the Chinese language culture is reasonable, even in those cases when it comes to the designation of empirically accessible objectivity. The main specific features of polysemy in the Chinese language are the complete heterogeneity of what is signified, and the lack of transparent grounds for identifying the genus-species subordination of the scope of general concepts. This can also serve as an explanation for the fact that we do not find a completely obvious and nondisputable analogue of the problem of universals of the Western model in the history of Chinese philosophy. C o n c l u s i o n s. Based on the peculiarities of the Chinese language culture, we can recognize as a reasonable a statement that the seemingly natural understanding of the essence – the subject, as something that remains the same (at least for a certain time), but it undergoes some changes through its manifestations – a predicate (properties and actions). It is not as necessary and axiomatic for Chinese thinkers as, for example, for ancient Greek philosophers. In addition, we can recognize the fact that the verb "to exist" does not fulfill the role of a necessary copula in judgments in the Chinese language, as a probable reason for the lack of fundamental problematization of the concept of "being" in the Chinese history of philosophy. In general, the context of the use of a certain word-sign in the Chinese language plays a determining role. The actualization of one or another meaning in an expression is formed not only by its integration into a certain text, but also by its purpose in accordance with the specific practice of application. Therefore, this can serve as an explanation for the absence of an original and axiomatic interpretation of truth as absolute, that is, unchanging and non-relative in the history of Chinese philosophy. (shrink)

In this paper we consider persuasion in the context of practical reasoning, and discuss the problems associated with construing reasoning about actions in a manner similar to reasoning about beliefs. We propose a perspective on practical reasoning as presumptive justification of a course of action, along with critical questions of this justification, building on the account of Walton. From this perspective, we articulate an interaction protocol, which we call PARMA, for dialogues over proposed actions based on this theory. We (...) outline an axiomatic semantics for the PARMA Protocol, and discuss two implementations which use this protocol to mediate a discussion between humans. We then show how our proposal can be made computational within the framework of agents based on the Belief-Desire-Intention model, and illustrate this proposal with an example debate within a multi agent system. (shrink)

This paper surveys ontological modeling of rhetorical concepts, developed for use in argument mining and other applications of computational rhetoric, projecting their future directions. We include ontological models of argument schemes applying Rhetorical Structure Theory (RST); the RhetFig proposal for modeling; the related RetFig Ontology of Rhetorical Figures for Serbian (developed by two of the authors); and the Lassoing Rhetoric project (developed by another of the authors). The Lassoing Rhetoric venture is interesting for its multifaceted approach (...) to linguistic devices, prominently including rhetorical figures, but also RST relations and stylistic models, like the use of historic present. This application takes a natural language text input and uses syntactic parsing tools to produce a knowledge base of linguistic entities using references to an OWL ontological framework, locating these devices using Semantic Web Rule Language (SWRL) logic rules. The paper also reports on a similar approach in research into detecting ironic tweets in a Serbian twitter corpus. The rhetorical schemes used for argument mining are also presented, as well as some suggestions for novel argument schemes based on the ontological approach to rhetorical figuration. (shrink)

There are many benefits of using argumentation-based techniques in multi-agent systems, as clearly shown in the literature. Such benefits come not only from the expressiveness that argumentation-based techniques bring to agent communication but also from the reasoning and decision-making capabilities under conditions of conflicting and uncertain information that argumentation enables for autonomous agents. When developing multi-agent applications in which argumentation will be used to improve agent communication and reasoning, argumentation schemes (reasoning patterns for argumentation) are useful (...) in addressing the requirements of the application domain in regards to argumentation (e.g., defining the scope in which argumentation will be used by agents in that particular application). In this work, we propose an argumentation framework that takes into account the particular structure of argumentation schemes at its core. This paper formally defines such a framework and experimentally evaluates its implementation for both argumentation-based reasoning and dialogues. (shrink)

There are many benefits of using argumentation-based techniques in multi-agent systems, as clearly shown in the literature. Such benefits come not only from the expressiveness that argumentation-based techniques bring to agent communication but also from the reasoning and decision-making capabilities under conditions of conflicting and uncertain information that argumentation enables for autonomous agents. When developing multi-agent applications in which argumentation will be used to improve agent communication and reasoning, argumentation schemes are useful in addressing the requirements (...) of the application domain in regards to argumentation. In this work, we propose an argumentation framework that takes into account the particular structure of argumentation schemes at its core. This paper formally defines such a framework and experimentally evaluates its implementation for both argumentation-based reasoning and dialogues. (shrink)

This work formalizes an informant-based structured argumentation approach in a multi-agent setting, where the knowledge base of an agent may include information provided by other agents, and each piece of knowledge comes attached with its informant. In that way, arguments are associated with the set of informants corresponding to the information they are built upon. Our approach proposes an informant-based notion of argument strength, where the strength of an argument is determined by the credibility of (...) its informant agents. Moreover, we consider that the strength of an argument is not absolute, but it is relative to the resolution of the conflicts the argument is involved in. In other words, the strength of an argument may vary from one context to another, as it will be determined by comparison to its attacking arguments (respectively, the arguments it attacks). Finally, we equip agents with the means to express reasons for or against the consideration of any piece of information provided by a given informant agent. Consequently, we allow agents to argue about the arguments’ strength through the construction of arguments that challenge (respectively, defeat) or are in favour of their informant agents. (shrink)

Objectives: Medical decision support and other intelligent applications in the life sciences depend on increasing amounts of digital information. Knowledge bases as well as formal ontologies are being used to organize biomedical knowledge and data. However, these two kinds of artefacts are not always clearly distinguished. Whereas the popular RDF(S) standard provides an intuitive triple-based representation, it is semantically weak. Description logics based ontology languages like OWL-DL carry a clear-cut semantics, but they are computationally expensive, and they (...) are often misinterpreted to encode all kinds of statements, including those which are not ontological. Method: We distinguish four kinds of statements needed to comprehensively represent domain knowledge: universal statements, terminological statements, statements about particulars and contingent statements. We argue that the task of formal ontologies is solely to represent universal statements, while the non-ontological kinds of statements can nevertheless be connected with ontological representations. To illustrate these four types of representations, we use a running example from parasitology. Results: We finally formulate recommendations for semantically adequate ontologies that can efficiently be used as a stable framework for more context-dependent biomedical knowledge representation and reasoning applications like clinical decision support systems. (shrink)

This is a brief letter outlining speculative ideas for semantic web reasoning about information assurance. Much work has been done on the development of semantic web applications for reasoning about information assurance. A significant portion of this work is focused upon semantic web ontologies and reasoning about security policies and the underlying implementation of those policies. While numerous semantic web-based security policy ontologies and reasoners exist, both academically and commercially, I will briefly focus on ideas (...) related to solutions to the problem of managing semantic web rules using algorithmic information theory. (shrink)

The study of some real reasonings (observed in the Humanities) reveals the very heterogeneous nature of the arguments used in the building of scientific knowledge and the complexity of their overall architecture. The building of a formal theory of the trace of these mental processes on the classical grounds of logic seems quite impossible. Instead, we propose a flexible methodology based on some local formal models, integrated in a global strategy. This strategy allows an empirical, but systematic, description (...) of the process of reasoning as a whole.The local models can be very different, from plausible inference to conditional transitivity. Their integration is based on some argumentative markers or structures (topoï). We propose a procedural semantics for some of them.This paper is based on the AVEROES Project, a study of the sea-borne trade in the Occidental Mediterranean Sea during the Roman Empire. (shrink)

We present a propositional and a first-order logic for reasoning about higher-order upper and lower probabilities. We provide sound and complete axiomatizations for the logics and we prove decidability in the propositional case. Furthermore, we show that the introduced logics generalize some existing probability logics.

Computational machineries dedicated to the attribution of legal responsibility should be based on (or, make use of) a stack of definitions relating the notion of legal responsibility to a number of suitably chosen causal notions. This paper presents a general analysis of legal responsibility and of causation in fact based on Hart and Honoré’s work. Some physical aspects of causation in fact are then treated within the “lite” version of DOLCE foundational ontology written in OWL-DL, a standard (...) class='Hi'>description logic for the Semantic Web. (shrink)

The paper gives ontologies in the Web Ontology Language (OWL) for Legal Case-based Reasoning (LCBR) systems, giving explicit, formal, and general specifications of a conceptualisation LCBR. Ontologies for different systems allows comparison and contrast between them. OWL ontologies are standardised, machine-readable formats that support automated processing with Semantic Web applications. Intermediate concepts, concepts between base-level concepts and higher level concepts, are central in LCBR. The main issues and their relevance to ontological reasoning and to LCBR are discussed. (...) Two LCBR systems (AS-CATO, which is based on CATO, and IBP) are analysed in terms of basic and intermediate concepts. Central components of the OWL ontologies for these systems are presented, pointing out differences and similarities. The main novelty of the paper is the ontological analysis and representation in OWL of LCBR systems. The paper also emphasises the important issues concerning the representation and reasoning of intermediate concepts. (shrink)

This paper surveys ontological modeling of rhetorical concepts, developed for use in argument mining and other applications of computational rhetoric, projecting their future directions. We include ontological models of argument schemes applying Rhetorical Structure Theory (RST); the RhetFig proposal for modeling; the related RetFig Ontology of Rhetorical Figures for Serbian (developed by two of the authors); and the Lassoing Rhetoric project (developed by another of the authors). The Lassoing Rhetoric venture is interesting for its multifaceted approach (...) to linguistic devices, prominently including rhetorical figures, but also RST relations and stylistic models, like the use of historic present. This application takes a natural language text input and uses syntactic parsing tools to produce a knowledge base of linguistic entities using references to an OWL ontological framework, locating these devices using Semantic Web Rule Language (SWRL) logic rules. The paper also reports on a similar approach in research into detecting ironic tweets in a Serbian twitter corpus. The rhetorical schemes used for argument mining are also presented, as well as some suggestions for novel argument schemes based on the ontological approach to rhetorical figuration. (shrink)

En philosophie, l'ontologie étudie ce qui pourrait exister : le type et la structure des objets, les propriétés, évènements, processus et relations. En ingénierie des connaissances, c'est la spécification de la conceptualisation d'un domaine de savoir. Ce domaine concerne ici la modélisation à base d'agents (ABM) pour les sciences de l'homme et de la société (SHS) en vue de la simulation par systèmes multi-agents (SMA). La modélisation SMA en SHS propose la formalisation d'une pluralité de points de vue dans (...) un cadre général qui permet de comparer et de combiner différents angles de réflexion. Agrémenté d'exemples issus de trois domaines (la géographie, l'économie et la sociologie), cet ouvrage utilise des formalismes principalement basés sur UML. L'exercice de description d'une ontologie est présenté comme un dialogue conceptuel interdisciplinaire et l'ontologie comme le médiateur de ce dialogue. (shrink)

This paper presents a formal ontology which intends to facilitate interoperability among agents belonging to software agent systems that use different agent communication languages. The followed design criteria for building the ontology are an elaboration on the “illocutionary force-plus-content” framework of speech acts theory. The ontology is specified in OWL. Reasons are presented through the paper why, in our opinion, an ontology based on speech acts theory and specified in a DL-based language is adequate for formal agent communication. (...) The ontology is divided into three layers: upper, standards and applications, grouping classes by different levels of abstraction. The formalism used in the specification of classes allows automated reasoning for locating classes in the taxonomy and recognizing individuals of classes. (shrink)

Although the last decade has seen a proliferation of ontological approaches to arguments, many of them employ ad hoc solutions to representing arguments, lack interoperability with other ontologies, or cover arguments only as part of a broader approach to evidence. To provide a better ontological representation of arguments, we present the Arguments Ontology (ArgO), a small ontology for arguments that is designed to be imported and easily extended by researchers who work in different upper-level ontology frameworks, different logics, (...) and different approaches to argument evaluation. Unlike most ontological approaches to arguments, ArgO utilizes Basic Formal Ontology (BFO) as an upper-level ontology, and may be used alongside other commonly used ontologies in the BFO framework, including boththe Information Artifact Ontology (IAO), and the Information Entity Ontology (INFO). Critically, our proposal is principled, based on rigorous definitions and formal axioms out of which characterizations of arguments naturally fall. It is our hope that ArgO may assist researchers in many projects, including: integrating heterogeneous sources of evidence, structuring the content of semantic wikis, and enhancing semantic reasoning. (shrink)