Results 1  10
of
114
Finite Model Reasoning in Horn Description Logics
"... We study finite model reasoning in expressive Horn description logics (DLs), starting with a reduction of finite ABox consistency to unrestricted ABox consistency. The reduction relies on reversing certain cycles in the TBox, an approach that originated in database theory, was later adapted to the ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We study finite model reasoning in expressive Horn description logics (DLs), starting with a reduction of finite ABox consistency to unrestricted ABox consistency. The reduction relies on reversing certain cycles in the TBox, an approach that originated in database theory, was later adapted
Horn Clause Contraction Functions
"... In classical, AGMstyle belief change, it is assumed that the underlying logic contains classical propositional logic. This is clearly a limiting assumption, particularly in Artificial Intelligence. Consequently there has been recent interest in studying belief change in approaches where the full e ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
use of Hornlike reasoning, such as logic programming, rulebased systems, and description logics. Finally, since Horn reasoning is weaker than classical reasoning, this work sheds light on the foundations of belief change. 1.
Animation of Horn Clause Proofs
"... Janus, a concurrent constraint programming language, provides an efficient and expressive means of constructing distributed and parallel computations [5]. Concurrent logic programming languages [4] are a special case of concurrent constraint programming languages in which the constraint system is co ..."
Abstract
 Add to MetaCart
Janus, a concurrent constraint programming language, provides an efficient and expressive means of constructing distributed and parallel computations [5]. Concurrent logic programming languages [4] are a special case of concurrent constraint programming languages in which the constraint system
Extended Caching and Backjumping for Expressive Description Logics
"... Due to the wide range of modelling constructs supported by the expressive DL SROIQ, the typically used tableau algorithms in competitive reasoning systems such as FaCT++ [16], HermiT, 3 or Pellet [14] have a very high worstcase complexity. The development of tableau optimisations that help to achie ..."
Abstract
 Add to MetaCart
Due to the wide range of modelling constructs supported by the expressive DL SROIQ, the typically used tableau algorithms in competitive reasoning systems such as FaCT++ [16], HermiT, 3 or Pellet [14] have a very high worstcase complexity. The development of tableau optimisations that help
The Compiler Construction System GENTLE  Manual and Tutorial
, 1992
"... Gentle defined by F.W. Schroer [Schroer 89] is a compiler description language in the tradition of logic programming [Clocksin et al 84] and two level grammars [Fisker et al 75, Koster 71, Watt 74]. It provides a common notation for high level description of analysis, transformation, and synthes ..."
Abstract
 Add to MetaCart
, and synthesis. A tool has been implemented to check the wellformedness of Gentle descriptions, and to generate efficient compilers. Gentle replaces a variety of special purpose languages by a general calculus: Horn logic. The language, a programming environment, and a tutorial are presented in this paper
Experimental analysis of some computation rules in a simple parallel reasoning system for the ALC description logic
 Applied Mathematics and Computer Science
, 2011
"... A computation rule determines the order of selecting premises during an inference process. In this paper we empirically analyse three particular computation rules in a tableaubased, parallel reasoning system for the ALC description logic, which is built in the relational programming model in the Oz ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
A computation rule determines the order of selecting premises during an inference process. In this paper we empirically analyse three particular computation rules in a tableaubased, parallel reasoning system for the ALC description logic, which is built in the relational programming model
Bounded Model Construction for Duration Calculus
, 2005
"... In this thesis, we shall present a tool, the BMC/DCValidator for automatic validation of duration calculus formulas. Duration calculus (DC for short) is a temporal logic, i.e. a logic for reasoning about time. DC may be used for specifying systems at an abstract level and the purpose of the tool is ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
is to verify that the system meets certain requirements, which are also specified using DC. The abstractness and expressiveness of DC makes it wellsuited for system description, but hard to verify properties by automatic means. Our tool provides an efficient implementation of the work of [MF02] whose main
Chapter 12 Rough Sets and Rough Logic: A KDD Perspective
"... Abstract Basic ideas of rough set theory were proposed by Zdzis law Pawlak [85, 86] in the early 1980’s. In the ensuing years, we have witnessed a systematic, world–wide growth of interest in rough sets and their applications. The main goal of rough set analysis is induction of approximations of con ..."
Abstract
 Add to MetaCart
of concepts. This main goal is motivated by the basic fact, constituting also the main problem of KDD, that languages we may choose for knowledge description are incomplete. A fortiori, we have to describe concepts of interest (features, properties, relations etc.) not completely but by means
Alternating Automata Semantic Constructions for the Bounded Model Checking of Regular Linear Temporal Logic
"... Abstract—We present two algorithms for bounded model checking of Regular Linear Temporal Logic (RLTL) specifications. Bounded model checking (BMC) is an effective algorithmic method for the verification of finite state systems against temporal specifications expressed in some linear temporal logic, ..."
Abstract
 Add to MetaCart
Abstract—We present two algorithms for bounded model checking of Regular Linear Temporal Logic (RLTL) specifications. Bounded model checking (BMC) is an effective algorithmic method for the verification of finite state systems against temporal specifications expressed in some linear temporal logic
The Theorem Prover Satchmo: Strategies, Heuristics, and Applications (System Description)
, 1995
"... Satchmo is an automated theorem prover for firstorder predicate logic. Its reasoning paradigm, model generation, is more powerful than the traditional refutation paradigm. Satchmo can be seen as an inference engine for expert systems capable of handling not only constructive and definite specifica ..."
Abstract
 Add to MetaCart
Satchmo is an automated theorem prover for firstorder predicate logic. Its reasoning paradigm, model generation, is more powerful than the traditional refutation paradigm. Satchmo can be seen as an inference engine for expert systems capable of handling not only constructive and definite
Results 1  10
of
114