| 1. |
- Bialek, Lukasz, et al.
(författare)
-
Lightweight Reasoning with Incomplete and Inconsistent Information : a Case Study
- 2014
-
Ingår i: 2014 IEEE/WIC/ACM International Joint Conferences on (Volume:3 ) Web Intelligence (WI) and Intelligent Agent Technologies (IAT). - : IEEE. - 9781479941438 ; , s. 325-332
-
Konferensbidrag (refereegranskat)abstract
- Dealing with heterogeneous information sources and reasoning techniques allowing for incomplete and inconsistent information is one of current challenges in the area of knowledge representation and reasoning. We advocate for 4QL, a rule-based query language, as a proper tool allowing one to address these challenges. To justify this point of view we discuss a rescue robotics scenario for which a simulator has been developed and tested. In particular, we present a planner using 4QL and, therefore, capable to deal with lack of knowledge and inconsistencies. Through the case study we show that our approach allows one to use lightweight knowledge representation tools: due to the use of 4QL tractability of modeling and reasoning is guaranteed and high usability is achieved.
|
|
| 2. |
- Cao, Son Thanh, et al.
(författare)
-
On the Web Ontology Rule Language OWL 2 RL
- 2011
-
Ingår i: Proceedings of the 3rd International Conference on Computational Collective Intelligence, Technologies and Applications (ICCCI). - Berlin, Heidelberg : Springer Berlin/Heidelberg. - 9783642239342 ; , s. 254-264
-
Konferensbidrag (refereegranskat)abstract
- It is known that the OWL 2 RL Web Ontology Language Profile has PTime data complexity and can be translated into Datalog. However, a knowledge base in OWL 2 RL may be unsatisfiable. The reason is that, when translated into Datalog, the result may consist of a Datalog program and a set of constraints in the form of negative clauses. In this paper we first identify a maximal fragment of OWL 2 RL called OWL 2 RL + with the property that every knowledge base expressed in this fragment can be translated into a Datalog program and hence is satisfiable. We then propose some extensions of OWL 2 RL and OWL 2 RL + that still have PTime data complexity.
|
|
| 3. |
- Cao, Son Thanh, et al.
(författare)
-
WORL : A Web Ontology Rule Language
- 2011
-
Ingår i: Proceedings of the 3rd International Conference on Knowledge and Systems Engineering (KSE). - : IEEE. - 9781457718489 ; , s. 32-39
-
Konferensbidrag (refereegranskat)abstract
- We develop a Web ontology rule language, called WORL, which combines a variant of OWL 2 RL with eDatalog-with-negation. We disallow the features of OWL 2 RL that play the role of constraints (i.e., the ones that are translated to negative clauses), but allow additional features like negation, the minimal number restriction and unary external checkable predicates to occur in the left hand side of concept inclusion axioms. Some restrictions are adopted to guarantee a translation into eDatalog-with-negation. We also develop the well-founded semantics for WORL and the standard semantics for stratified WORL (SWORL) via translation into eDatalog-with-negation. Both WORL and SWORL have PTime data complexity. In contrast to the existing combined formalisms, in WORL and SWORL negation in concept inclusion axioms is interpreted using nonmonotonic semantics.
|
|
| 4. |
- Cao, Son Thanh, et al.
(författare)
-
WORL : a nonmonotonic rule language for the semantic web
- 2014
-
Ingår i: Vietnam Journal of Computer Science. - : Springer Berlin/Heidelberg. - 2196-8888 .- 2196-8896. ; 1:1, s. 57-69
-
Tidskriftsartikel (refereegranskat)abstract
- We develop a new Web ontology rule language, called WORL, which combines a variant of OWL 2 RL with eDatalog ¬ . We allow additional features like negation, the minimal number restriction and unary external checkable predicates to occur at the left-hand side of concept inclusion axioms. Some restrictions are adopted to guarantee a translation into eDatalog ¬ . We also develop the well-founded semantics and the stable model semantics for WORL as well as the standard semantics for stratified WORL (SWORL) via translation into eDatalog ¬ . Both WORL with respect to the well-founded semantics and SWORL with respect to the standard semantics have PTime data complexity. In contrast to the existing combined formalisms, in WORL and SWORL negation in concept inclusion axioms is interpreted using nonmonotonic semantics.
|
|
| 5. |
- Doherty, Patrick, et al.
(författare)
-
Contextual Coalitional Games
- 2011
-
Ingår i: Proceedings of the 4th Indian Conference on Logic and its Applications (ICLA). - Berlin, Heidelberg : Springer Berlin/Heidelberg. ; , s. 65-78
-
Konferensbidrag (refereegranskat)abstract
- The study of cooperation among agents is of central interest in multi-agent systems research. A popular way to model cooperation is through coalitional game theory. Much research in this area has had limited practical applicability as regards real-world multi-agent systems due to the fact that it assumesdeterministic payoffs to coalitions and in addition does not apply to multi-agent environments that arestochastic in nature. In this paper, we propose a novel approach to modeling such scenarios where coalitional games will be contextualized through the use of logical expressions representing environmental and other state, and probability distributions will be placed on the space of contexts in order to model the stochastic nature of the scenarios. More formally, we present a formal representation language for representing contextualized coalitional games embedded in stochastic environments and we define and show how to compute expected Shapley values in such games in a computationally efficient manner. We present the value of the approach through an example involving robotics assistance in emergencies.
|
|
| 6. |
- Doherty, Patrick, et al.
(författare)
-
Tractable model checking for fragments of higher-order coalition logic
- 2011
-
Ingår i: Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 2. - Richland : AAAI Press. - 9780982657164 ; , s. 743-750
-
Konferensbidrag (refereegranskat)abstract
- A number of popular logical formalisms for representing and reasoning about the abilities of teams or coalitions of agents have been proposed beginning with the Coalition Logic (CL) of Pauly. Ågotnes et al introduced a means of succinctly expressing quantification over coalitions without compromising the computational complexity of model checking in CL by introducing Quantified Coalition Logic (QCL). QCL introduces a separate logical language for characterizing coalitions in the modal operators used in QCL. Boella et al, increased the representational expressibility of such formalisms by introducing Higher-Order Coalition Logic (HCL), a monadic second-order logic with special set grouping operators. Tractable fragments of HCL suitable for efficient model checking have yet to be identified. In this paper, we relax the monadic restriction used in HCL and restrict ourselves to the diamond operator. We show how formulas using the diamond operator are logically equivalent to second-order formulas. This permits us to isolate and define well-behaved expressive fragments of second-order logic amenable to model-checking in PTime. To do this, we appeal to techniques used in deductive databases and quantifier elimination. In addition, we take advantage of the monotonicity of the effectivity function resulting in exponentially more succinct representation of models. The net result is identification of highly expressible fragments of a generalized HCL where model checking can be done efficiently in PTime.
|
|
| 7. |
- Dunin-Keplicz, Barbara, et al.
(författare)
-
Converse-PDL with Regular Inclusion Axioms : A Framework for MAS Logics
- 2011
-
Ingår i: Journal of Applied Non-Classical Logics. - Cachan, France : Lavoisier. - 1166-3081 .- 1958-5780. ; 21:1, s. 61-91
-
Tidskriftsartikel (refereegranskat)abstract
- In this paper we study automated reasoning in the modal logic CPDLreg which is a combination of CPDL (Propositional Dynamic Logic with Converse) and REGc (Regular Grammar Logic with Converse). The logic CPDL is widely used in many areas, including program verification, theory of action and change, and knowledge representation. On the other hand, the logic REGc is applicable in reasoning about epistemic states and ontologies (via Description Logics). The modal logic CPDLreg can serve as a technical foundation for reasoning about agency. Even very rich multi-agent logics can be embedded into CPDLreg via a suitable translation. Therefore, CPDLreg can serve as a test bed to implement and possibly verify new ideas without providing specific automated reasoning techniques for the logic in question. This process can to a large extent be automated. The idea of embedding various logics into CPDLreg is illustrated on a rather advanced logic TEAMLOGK designed to specify teamwork in multi-agent systems. Apart from defining informational and motivational attitudes of groups of agents, TEAMLOGK allows for grading agents' beliefs, goals and intentions. The current paper is a companion to our paper (Dunin-Kęplicz et al., 2010a). The main contribution are proofs of soundness and completeness of the tableau calculus for CPDLreg provided in (Dunin-Kęplicz et al., 2010a).
|
|
| 8. |
- Dunin-Keplicz, Barbara, et al.
(författare)
-
Distributed Paraconsistent Belief Fusion
- 2013
-
Ingår i: Intelligent Distributed Computing VI. - Berlin, Heidelberg : Springer Berlin/Heidelberg. - 9783642325236 - 9783642325243 ; , s. 59-69
-
Konferensbidrag (övrigt vetenskapligt/konstnärligt)abstract
- The current paper is devoted to belief fusion when information sources may deliver incomplete and inconsistent information. In such cases paraconsistent and commonsense reasoning techniques can be used to complete missing knowledge and disambiguate inconsistencies. We propose a novel, realistic model of distributed belief fusion and an implementation framework guaranteeing its tractability.
|
|
| 9. |
- Dunin-Keplicz, Barbara, et al.
(författare)
-
Epistemic Profiles and Belief Structures
- 2012
-
Ingår i: Agent and Multi-Agent Systems. Technologies and Applications. - Berlin, Heidelberg : Springer Berlin/Heidelberg. - 9783642309465 - 9783642309472 ; , s. 360-369
-
Konferensbidrag (refereegranskat)abstract
- This book constitutes the refereed proceedings of the 6th KES International Conference on Agent and Multi-Agent Systems, KES-AMSTA 2012, held in Dubrovnik, Croatia, in June 2012. The conference attracted a substantial number of researchers and practitioners from all over the world who submitted their papers for ten main tracks covering the methodology and applications of agent and multi-agent systems, one workshop (TRUMAS 2012) and five special sessions on specific topics within the field. The 66 revised papers presented were carefully reviewed and selected for inclusion in the book. The papers are organized in topical sections on virtual organizations, knowledge and learning agents, intelligent workflow, cloud computing and intelligent systems, self-organization, ICT-based alternative and augmentative communication, multi-agent systems, mental and holonic models, assessment methodologies in multi-agent and other paradigms, business processing agents, Trumas 2012 (first international workshop), conversational agents and agent teams, digital economy, and multi-agent systems in distributed environments.
|
|
| 10. |
- Dunin-Keplicz, Barbara, et al.
(författare)
-
Horn-TeamLog: A Horn Fragment of TeamLog with PTime Data Complexity
- 2013
-
Ingår i: Computational Collective Intelligence. Technologies and Applications. - Berlin, Heidelberg : Springer Berlin/Heidelberg. - 9783642404948 - 9783642404955 ; , s. 143-153
-
Konferensbidrag (refereegranskat)abstract
- The logic TeamLog proposed by Dunin-Kęplicz and Verbrugge is used to express properties of agents’ cooperation in terms of individual, bilateral and collective informational and motivational attitudes like beliefs, goals and intentions. In this paper we isolate a Horn fragment of TeamLog, called Horn-TeamLog, and we show that it has PTime data complexity.
|
|
