| 1. |
- Doherty, Patrick, 1957-, et al.
(författare)
-
Approximation Transducers and Trees : A Technique for Combining Rough and Crisp Knowledge
- 2004
-
Ingår i: Rough-Neural Computing: Techniques for Computing with Words. - Berlin, Heidelberg, New York : Springer. - 9783540430599 - 3540430598 ; , s. 189-218
-
Bokkapitel (övrigt vetenskapligt/konstnärligt)abstract
- Soft computing comprises various paradigms dedicated to approximately solving real-world problems, e.g., in decision making, classification or learning; among these paradigms are fuzzy sets, rough sets, neural networks, and genetic algorithms.It is well understood now in the soft computing community that hybrid approaches combining various paradigms provide very promising attempts to solving complex problems. Exploiting the potential and strength of both neural networks and rough sets, this book is devoted to rough-neurocomputing which is also related to the novel aspect of computing based on information granulation, in particular to computing with words. It provides foundational and methodological issues as well as applications in various fields.
|
|
| 2. |
- Doherty, Patrick, 1957-, et al.
(författare)
-
Knowledge Representation Techniques. : a rough set approach
- 2006
-
Bok (övrigt vetenskapligt/konstnärligt)abstract
- The basis for the material in this book centers around a long term research project with autonomous unmanned aerial vehicle systems. One of the main research topics in the project is knowledge representation and reasoning. The focus of the research has been on the development of tractable combinations of approximate and nonmonotonic reasoning systems. The techniques developed are based on intuitions from rough set theory. Efforts have been made to take theory into practice by instantiating research results in the context of traditional relational database or deductive database systems. This book contains a cohesive, self-contained collection of many of the theoretical and applied research results that have been achieved in this project and for the most part pertain to nonmonotonic and approximate reasoning systems developed for an experimental unmanned aerial vehicle system used in the project. This book should be of interest to the theoretician and applied researcher alike and to autonomous system developers and software agent and intelligent system developers.
|
|
| 3. |
- Bialek, Lukasz, et al.
(författare)
-
Belief Shadowing
- 2019
-
Ingår i: Engineering Multi-Agent Systems. EMAS 2018. - Cham : Springer. ; , s. 158-180
-
Konferensbidrag (refereegranskat)
|
|
| 4. |
- 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.
|
|
| 5. |
- Bialek, Lukasz, et al.
(författare)
-
Towards a Paraconsistent Approach to Actions in Distributed Information-Rich Environments
- 2018
-
Ingår i: Intelligent Distributed Computing XI. - Cham : Springer. - 9783319663784 - 9783319663791 ; , s. 49-60
-
Konferensbidrag (refereegranskat)abstract
- The paper introduces ActLog, a rule-based language capable of specifying actions paraconsistently. ActLog is an extension of 4QL Bel " role="presentation"> Bel , a rule-based language for reasoning with paraconsistent and paracomplete belief bases and belief structures. Actions considered in the paper act on belief bases rather than states represented as sets of ground literals. Each belief base stores multiple world representations which can be though of as a representation of possible states. In this context ActLog’s action may be then seen as a method of transforming one belief base into another. In contrast to other approaches, ActLog permits to execute actions even if the underlying belief base state is partial or inconsistent. Finally, the framework introduced in this paper is tractable.
|
|
| 6. |
- 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.
|
|
| 7. |
- 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.
|
|
| 8. |
- 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.
|
|
| 9. |
- De Angelis, Francesco Luca, et al.
(författare)
-
Paraconsistent Rule-Based Reasoning with Graded Truth Values
- 2018
-
Ingår i: Journal of Applied Logic. - : College Publications. - 2055-3706 .- 2055-3714. ; 5:1, s. 185-220
-
Tidskriftsartikel (refereegranskat)abstract
- Modern artificial systems, such as cooperative traffic systems or swarm robotics, are made of multiple autonomous agents, each handling uncertain, partial and potentially inconsistent information, used in their reasoning and decision making. Graded reasoning, being a suitable tool for addressing phenomena related to such circumstances, is investigated in the literature in many contexts – from graded modal logics to various forms of approximate reasoning. In this paper we first introduce a family of many-valued paraconsistent logics parametrised by a number of truth/falsity/inconsistency grades allowing one to handle multiple truth-values at the desired level of accuracy. Second, we define a corresponding family of rule-based languages with graded truth-values as first-class citizens, enjoying tractable query evaluation. In addition, we introduce introspection operators allowing one to resolve inconsistencies and/or lack of information in a non-monotonic manner. We illustrate and discuss the use of the framework in an autonomous robot scenario.
|
|
| 10. |
|
|
