Results 1 - 10
of
2,862
Knowledge compilation for description logics
- In Nachum Dershowitz and Andrei Voronkov, editors, Proceedings of the Fourteenth International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR), Short papers
, 2007
"... Knowledge compilation is a technique for dealing with computational in-tractability of propositional reasoning. Transforming a given knowledge base into a special normal form ([MR03,DH05]) is aiming at efficient rea-soning. We propose to apply this technique to knowledge bases defined ..."
Abstract
-
Cited by 3 (0 self)
- Add to MetaCart
Knowledge compilation is a technique for dealing with computational in-tractability of propositional reasoning. Transforming a given knowledge base into a special normal form ([MR03,DH05]) is aiming at efficient rea-soning. We propose to apply this technique to knowledge bases defined
Description Logic Programs: Combining Logic Programs with Description Logic
, 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
Tractable reasoning and efficient query answering in description logics: The DL-Lite family
- J. OF AUTOMATED REASONING
, 2007
"... We propose a new family of Description Logics (DLs), called DL-Lite, specifically tailored to capture basic ontology languages, while keeping low complexity of reasoning. Reasoning here means not only computing subsumption between concepts, and checking satisfiability of the whole knowledge base, b ..."
Abstract
-
Cited by 497 (123 self)
- Add to MetaCart
We propose a new family of Description Logics (DLs), called DL-Lite, specifically tailored to capture basic ontology languages, while keeping low complexity of reasoning. Reasoning here means not only computing subsumption between concepts, and checking satisfiability of the whole knowledge base
The synchronous dataflow programming language LUSTRE
- Proceedings of the IEEE
, 1991
"... This paper describes the language Lustre, which is a dataflow synchronous language, designed for programming reactive systems --- such as automatic control and monitoring systems --- as well as for describing hardware. The dataflow aspect of Lustre makes it very close to usual description tools in t ..."
Abstract
-
Cited by 646 (50 self)
- Add to MetaCart
This paper describes the language Lustre, which is a dataflow synchronous language, designed for programming reactive systems --- such as automatic control and monitoring systems --- as well as for describing hardware. The dataflow aspect of Lustre makes it very close to usual description tools
Multiscalar Processors
- In Proceedings of the 22nd Annual International Symposium on Computer Architecture
, 1995
"... Multiscalar processors use a new, aggressive implementation paradigm for extracting large quantities of instruction level parallelism from ordinary high level language programs. A single program is divided into a collection of tasks by a combination of software and hardware. The tasks are distribute ..."
Abstract
-
Cited by 589 (30 self)
- Add to MetaCart
are dynamically routed among the many parallel pro-cessing units with the help of compiler-generated masks. Memory accesses may occur speculatively without knowledge of preceding loads or stores. Addresses are disambiguated dynamically, many in parallel, and processing waits only for true data dependence
Case-based reasoning; Foundational issues, methodological variations, and system approaches
- AI COMMUNICATIONS
, 1994
"... Case-based reasoning is a recent approach to problem solving and learning that has got a lot of attention over the last few years. Originating in the US, the basic idea and underlying theories have spread to other continents, and we are now within a period of highly active research in case-based rea ..."
Abstract
-
Cited by 855 (25 self)
- Add to MetaCart
, to which the subsequent descriptions and discussions will refer. The framework is influenced by recent methodologies for knowledge level descriptions of intelligent systems. The methods for case retrieval, reuse, solution testing, and learning are summa-rized, and their actual realization is discussed
Choices, values and frames.
- 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
, 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
Knowledge compilation and theory approximation
- Journal of the ACM
, 1996
"... Computational efficiency is a central concern in the design of knowledge representation systems. In order to obtain efficient systems, it has been suggested that one should limit the form of the statements in the knowledge base or use an incomplete inference mechanism. The former approach is often t ..."
Abstract
-
Cited by 185 (5 self)
- Add to MetaCart
too restrictive for practical applications, whereas the latter leads to uncertainty about exactly what can and cannot be inferred from the knowledge base. We present a third alternative, in which knowledge given in a general representation language is translated (compiled) into a tractable form
Tableau Algorithms for Description Logics
- 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
Results 1 - 10
of
2,862