| 1. |
- 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.
|
|
| 2. |
- Doherty, Patrick, 1957-, et al.
(författare)
-
Approximate Databases : A support tool for approximate reasoning
- 2006
-
Ingår i: Journal of applied non-classical logics. - : Éditions Hermès-Lavoisier. - 1166-3081 .- 1958-5780. ; 16:1-2, s. 87-118
-
Tidskriftsartikel (refereegranskat)abstract
- This paper describes an experimental platform for approximate knowledge databases called the Approximate Knowledge Database (AKDB), based on a semantics inspired by rough sets. The implementation is based upon the use of a standard SQL database to store logical facts, augmented with several query interface layers implemented in JAVA through which extensional, intensional and local closed world nonmonotonic queries in the form of crisp or approximate logical formulas can be evaluated tractably. A graphical database design user interface is also provided which simplifies the design of databases, the entering of data and the construction of queries. The theory and semantics for AKDBs is presented in addition to application examples and details concerning the database implementation.
|
|
| 3. |
- Doherty, Patrick, 1957-, et al.
(författare)
-
Dynamics of approximate information fusion
- 2007
-
Ingår i: Proceedings of the International Conference on Rough Sets and Emerging Intelligent Systems Paradigms (RSEISP). - Heidelberg, Germany : Springer Berlin/Heidelberg. - 9783540734505 ; , s. 668-677
-
Konferensbidrag (refereegranskat)abstract
- The multi-agent system paradigm has proven to be a useful means of abstraction when considering distributed systems with interacting components. It is often the case that each component may be viewed as an intelligent agent with specific and often limited perceptual capabilities. It is also the case that these agent components may be used as information sources and such sources may be aggregated to provide global information about particular states, situations or activities in the embedding environment. This paper investigates a framework for information fusion based on the use of generalizations of rough set theory and the use of dynamic logic as a basis for aggregating similarity relations among objects where the similarity relations represent individual agents perceptual capabilities or limitations. As an added benefit, it is shown how this idea may also be integrated into description logics.
|
|
| 4. |
- Doherty, Patrick, 1957-, et al.
(författare)
-
Reasoning with Qualitative Preferences and Cardinalities Using Generalized Circumscription
- 2008
-
Ingår i: Proceedings of the 11th International Conference on Principles of Knowledge Representation and Reasoning (KR). - : AAAI Press. - 9781577353843 ; , s. 560-570
-
Konferensbidrag (refereegranskat)abstract
- The topic of preference modeling has recently attracted the interest of a number of sub-disciplines in artificial intelligence such as the nonmonotonic reasoning and action and change communities. The approach in these communities focuses on qualitative preferences and preference models which provide more natural representations from a~commonsense perspective. In this paper, we show how generalized circumscription can be used as a highly expressive framework for qualitative preference modeling. Generalized circumscription proposed by Lifschitz allows for predicates (and thus formulas) to be minimized relative to arbitrary pre-orders (reflexive and transitive). Although it has received little attention, we show how it may be used to model and reason about elaborate qualitative preference relations. One of the perceived weaknesses with any type of circumscription is the 2nd-order nature of the representation. The paper shows how a large variety of preference theories represented using generalized circumscription can in fact be reduced to logically equivalent first-order theories in a constructive way. Finally, we also show how preference relations represented using general circumscription can be extended with cardinality constraints and when these extensions can also be reduced to logically equivalent first-order theories.
|
|
| 5. |
- Doherty, Patrick, 1957-, et al.
(författare)
-
Similarity, approximations and vagueness
- 2005
-
Ingår i: Proceedings of the 10th International Conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing (RSFDGrC). - Berlin, Heidelberg : Springer. - 3540286535 ; , s. 541-550
-
Konferensbidrag (refereegranskat)abstract
- The relation of similarity is essential in understanding and developing frameworks for reasoning with vague and approximate concepts. There is a wide spectrum of choice as to what properties we associate with similarity and such choices determine the nature of vague and approximate concepts defined in terms of these relations. Additionally, robotic systems naturally have to deal with vague and approximate concepts due to the limitations in reasoning and sensor capabilities. Halpern [1] introduces the use of subjective and objective states in a modal logic formalizing vagueness and distinctions in transitivity when an agent reasons in the context of sensory and other limitations. He also relates these ideas to a solution to the Sorities and other paradoxes. In this paper, we generalize and apply the idea of similarity and tolerance spaces [2,3,4,5], a means of constructing approximate and vague concepts from such spaces and an explicit way to distinguish between an agent’s objective and subjective states. We also show how some of the intuitions from Halpern can be used with similarity spaces to formalize the above-mentioned Sorities and other paradoxes.
|
|
| 6. |
- Gabbay, Dov M., et al.
(författare)
-
Second-Order Quantifier Elimination. Foundations, Computational Aspects and Applications
- 2008. - 1
-
Bok (övrigt vetenskapligt/konstnärligt)abstract
- In recent years there has been an increasing use of logical methods and significant new developments have been spawned in several areas of computer science, ranging from artificial intelligence and software engineering to agent-based systems and the semantic web. In the investigation and application of logical methods there is a tension between: * the need for a representational language strong enough to express domain knowledge of a particular application, and the need for a logical formalism general enough to unify several reasoning facilities relevant to the application, on the one hand, and * the need to enable computationally feasible reasoning facilities, on the other hand. Second-order logics are very expressive and allow us to represent domain knowledge with ease, but there is a high price to pay for the expressiveness. Most second-order logics are incomplete and highly undecidable. It is the quantifiers which bind relation symbols that make second-order logics computationally unfriendly. It is therefore desirable to eliminate these second-order quantifiers, when this is mathematically possible; and often it is. If second-order quantifiers are eliminable we want to know under which conditions, we want to understand the principles and we want to develop methods for second-order quantifier elimination. This book provides the first comprehensive, systematic and uniform account of the state-of-the-art of second-order quantifier elimination in classical and non-classical logics. It covers the foundations, it discusses in detail existing second-order quantifier elimination methods, and it presents numerous examples of applications and non-standard uses in different areas. These include: * classical and non-classical logics, * correspondence and duality theory, * knowledge representation and description logics, * commonsense reasoning and approximate reasoning, * relational and deductive databases, and * complexity theory. The book is intended for anyone interested in the theory and application of logics in computer science and artificial intelligence.
|
|
| 7. |
- Grabowski, Michali, et al.
(författare)
-
A Technique for Learning Similarities on Complex Structures with Applications to Extracting Ontologies
- 2005
-
Ingår i: Proceedings of the 3rd Atlantic Web Intelligence Conference (AWIC). - Berlin, Heidelberg : Springer. ; , s. 991-995
-
Konferensbidrag (refereegranskat)abstract
- A general similarity-based algorithm for extracting ontologies from data has been provided in [1]. The algorithm works over arbitrary approximation spaces, modeling notions of similarity and mereological part-of relations (see, e.g., [2, 3, 4, 5]). In the current paper we propose a novel technique of machine learning similarity on tuples on the basis of similarities on attribute domains. The technique reflects intuitions behind tolerance spaces of [6] and similarity spaces of [7]. We illustrate the use of the technique in extracting ontologies from data.
|
|
| 8. |
|
|
| 9. |
- Maluszynski, Jan, 1941-, et al.
(författare)
-
A Four-Valued Logic for Rough Set-Like Approximate Reasoning
- 2007
-
Ingår i: Transactions on Rough Sets VI. - Berlin, Heidelberg : Springer. - 3540711988 - 9783540711988 ; , s. 176-190
-
Bokkapitel (refereegranskat)abstract
- Annotation The LNCS journal Transactions on Rough Sets is devoted to the entire spectrum of rough sets related issues, from logical and mathematical foundations, through all aspects of rough set theory and its applications, such as data mining, knowledge discovery, and intelligent information processing, to relations between rough sets and other approaches to uncertainty, vagueness, and incompleteness, such as fuzzy sets and theory of evidence. Volume VI of the Transactions on Rough Sets (TRS) commemorates the life and work of Zdzislaw Pawlak (1926-2006). His legacy is rich and varied. Prof. Pawlak's research contributions have had far-reaching implications inasmuch as his works are fundamental in establishing new perspectives for scientific research in a wide spectrum of fields. This volume of the TRS presents papers that reflect the profound influence of a number of research initiatives by Professor Pawlak. In particular, this volume introduces a number of new advances in the foundations and applications of artificial intelligence, engineering, logic, mathematics, and science. These advances have significant implications in a number of research areas such as the foundations of rough sets, approximate reasoning, bioinformatics, computational intelligence, cognitive science, data mining, information systems, intelligent systems, machine intelligence, and security.
|
|
| 10. |
- Maluszynski, Jan, 1941-, et al.
(författare)
-
Paraconsistent Logic Programs with Four-valued Rough Sets
- 2008
-
Ingår i: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). - Germany : Springer. - 9783540884231 - 9783540884255 ; , s. 41-51
-
Konferensbidrag (refereegranskat)abstract
- This paper presents a language for defining four-valued rough sets and to reason about them. Our framework brings together two major fields: rough sets and paraconsistent logic programming. On the one hand it provides a paraconsistent approach, based on four-valued rough sets, for integrating knowledge from different sources and reasoning in the presence of inconsistencies. On the other hand, it also caters for a specific type of uncertainty that originates from the fact that an agent may perceive different objects of the universe as being indiscernible. This paper extends the ideas presented in [9]. Our language allows the user to define similarity relations and use the approximations induced by them in the definition of other four-valued sets. A positive aspect is that it allows users to tune the level of uncertainty or the source of uncertainty that best suits applications.
|
|
