Results 1 - 10 of 2,146

Description Logic Programs: Combining Logic Programs with Description Logic

by Benjamin N. Grosof, Ian Horrocks , 2002
"... We show how to interoperate, semantically and inferentially, between the leading Semantic Web approaches to rules (RuleML Logic Programs) and ontologies (OWL/DAML+OIL Description Logic) via analyzing their expressive intersection. To do so, we define a new intermediate knowledge representation (KR) ..."
Abstract - Cited by 529 (46 self) - Add to MetaCart
We show how to interoperate, semantically and inferentially, between the leading Semantic Web approaches to rules (RuleML Logic Programs) and ontologies (OWL/DAML+OIL Description Logic) via analyzing their expressive intersection. To do so, we define a new intermediate knowledge representation (KR

Graph-based algorithms for Boolean function manipulation

by Randal E. Bryant - IEEE TRANSACTIONS ON COMPUTERS , 1986
"... In this paper we present a new data structure for representing Boolean functions and an associated set of manipulation algorithms. Functions are represented by directed, acyclic graphs in a manner similar to the representations introduced by Lee [1] and Akers [2], but with further restrictions on th ..."
Abstract - Cited by 3526 (46 self) - Add to MetaCart
on the ordering of decision variables in the graph. Although a function requires, in the worst case, a graph of size exponential in the number of arguments, many of the functions encountered in typical applications have a more reasonable representation. Our algorithms have time complexity proportional

Choices, values and frames.

by Daniel Kahneman - American Psychologist, , 1984
"... Making decisions is like speaking prose-people do it all the time, knowingly or unknowingly. It is hardly surprising, then, that the topic of decision making is shared by many disciplines, from mathematics and statistics, through economics and political science, to sociology and psychology. The stu ..."
Abstract - Cited by 684 (9 self) - Add to MetaCart
. The study of decisions addresses both normative and descriptive questions. The normative analysis is concerned with the nature of rationality and the logic of decision making. The descriptive analysis, in contrast, is concerned with people's beliefs and preferences as they are, not as they should be

Practical Reasoning for Expressive Description Logics

by Ian Horrocks, Ulrike Sattler, Stephan Tobies , 1999
"... . Description Logics (DLs) are a family of knowledge representation formalisms mainly characterised by constructors to build complex concepts and roles from atomic ones. Expressive role constructors are important in many applications, but can be computationally problematical. We present an algorithm ..."
Abstract - Cited by 354 (65 self) - Add to MetaCart
. Description Logics (DLs) are a family of knowledge representation formalisms mainly characterised by constructors to build complex concepts and roles from atomic ones. Expressive role constructors are important in many applications, but can be computationally problematical. We present

Tableau Algorithms for Description Logics

by Franz Baader, Ulrike Sattler - STUDIA LOGICA , 2000
"... Description logics are a family of knowledge representation formalisms that are descended from semantic networks and frames via the system Kl-one. During the last decade, it has been shown that the important reasoning problems (like subsumption and satisfiability) in a great variety of descriptio ..."
Abstract - Cited by 260 (26 self) - Add to MetaCart
Description logics are a family of knowledge representation formalisms that are descended from semantic networks and frames via the system Kl-one. During the last decade, it has been shown that the important reasoning problems (like subsumption and satisfiability) in a great variety

Using an Expressive Description Logic: FaCT or Fiction?

by Ian R. Horrocks - In Proc. of KR-98 , 1998
"... Description Logics form a family of formalisms closely related to semantic networks but with the distinguishing characteristic that the semantics of the concept description language is formally defined, so that the subsumption relationship between two concept descriptions can be computed by a suitab ..."
Abstract - Cited by 273 (50 self) - Add to MetaCart
subsumption testing algorithm for a relatively expressive Description Logic which, in spite of the logic's worst case complexity, has been shown to perform well in realistic applications. 1 INTRODUCTION Description Logics (DLs) form a family of formalisms which have grown out of knowledge representation

Complexity Results and Practical Algorithms for Logics in Knowledge Representation

by Stephan Tobies , 2001
"... Description Logics (DLs) are used in knowledge-based systems to represent and reason about terminological knowledge of the application domain in a semantically well-defined manner. In this thesis, we establish a number of novel complexity results and give practical algorithms for expressive DLs that ..."
Abstract - Cited by 189 (0 self) - Add to MetaCart
Description Logics (DLs) are used in knowledge-based systems to represent and reason about terminological knowledge of the application domain in a semantically well-defined manner. In this thesis, we establish a number of novel complexity results and give practical algorithms for expressive DLs

Reasoning within Fuzzy Description Logics

by Umberto Straccia - Journal of Artificial Intelligence Research , 2001
"... Description Logics (DLs) are suitable, well-known, logics for managing structured knowledge. They allow reasoning about individuals and well defined concepts, i.e. set of individuals with common properties. The experience in using DLs in applications has shown that in many cases we would like to ext ..."
Abstract - Cited by 197 (28 self) - Add to MetaCart
Description Logics (DLs) are suitable, well-known, logics for managing structured knowledge. They allow reasoning about individuals and well defined concepts, i.e. set of individuals with common properties. The experience in using DLs in applications has shown that in many cases we would like

Practical reasoning for very expressive description logics

by Ian Horrocks - Journal of the Interest Group in Pure and Applied Logics 8 , 2000
"... Description Logics (DLs) are a family of knowledge representation formalisms mainly characterised by constructors to build complex concepts and roles from atomic ones. Expressive role constructors are important in many applications, but can be computationally problematical. We present an algorithm t ..."
Abstract - Cited by 185 (22 self) - Add to MetaCart
Description Logics (DLs) are a family of knowledge representation formalisms mainly characterised by constructors to build complex concepts and roles from atomic ones. Expressive role constructors are important in many applications, but can be computationally problematical. We present an algorithm

AL-log: Integrating Datalog and Description Logics

by Francesco M. Donini, Maurizio Lenzerini, Daniele Nardi, Andrea Schaerf - JOURNAL OF INTELLIGENT INFORMATION SYSTEMS , 1998
"... We presenan integrated system for knowledge representation, called AL-log, based on description logics and the deductive database language Datalog. AL-log embodies two subsystems, called structural and relational. The former allows for the definition of structural knowledge about classes of interest ..."
Abstract - Cited by 167 (12 self) - Add to MetaCart
We presenan integrated system for knowledge representation, called AL-log, based on description logics and the deductive database language Datalog. AL-log embodies two subsystems, called structural and relational. The former allows for the definition of structural knowledge about classes
Results 1 - 10 of 2,146