Results 1  10
of
11,042
Bayesian Description Logics. In:
 Proc. of DL’14. CEUR Workshop Proceedings,
, 2014
"... Abstract This chapter considers, on the one hand, extensions of Description Logics by features not available in the basic framework, but considered important for using Description Logics as a modeling language. In particular, it addresses the extensions concerning: concrete domain constraints; moda ..."
Abstract

Cited by 394 (49 self)
 Add to MetaCart
; modal, epistemic, and temporal operators; probabilities and fuzzy logic; and defaults. On the other hand, it considers nonstandard inference problems for Description Logics, i.e., inference problems thatunlike subsumption or instance checkingare not available in all systems, but have turned out
A ControlTheoretic Approach to Flow Control
, 1991
"... This paper presents a controltheoretic approach to reactive flow control in networks that do not reserve bandwidth. We assume a roundrobinlike queue service discipline in the output queues of the network’s switches, and propose deterministic and stochastic models for a single conversation in a ne ..."
Abstract

Cited by 454 (8 self)
 Add to MetaCart
are overcome by a novel estimation scheme based on fuzzy logic. We then present a technique to extract and use additional information horn the system to develop a continuoustime system model. This is used to design a wuisnt of the control law that is also provably stable, and, in addition, takes control
A Logic for Reasoning about Time and Reliability
 Formal Aspects of Computing
, 1994
"... We present a logic for stating properties such as, "after a request for service there is at least a 98% probability that the service will be carried out within 2 seconds". The logic extends the temporal logic CTL by Emerson, Clarke and Sistla with time and probabilities. Formulas are inter ..."
Abstract

Cited by 371 (1 self)
 Add to MetaCart
are interpreted over discrete time Markov chains. We give algorithms for checking that a given Markov chain satisfies a formula in the logic. The algorithms require a polynomial number of arithmetic operations, in size of both the formula and This research report is a revised and extended version of a paper
A Fast LinearArithmetic Solver for DPLL(T)
, 2006
"... We present a new Simplexbased linear arithmetic solver that can be integrated efficiently in the DPLL(T) framework. The new solver improves over existing approaches by enabling fast backtracking, supporting a priori simplification to reduce the problem size, and providing an efficient form of the ..."
Abstract

Cited by 289 (13 self)
 Add to MetaCart
We present a new Simplexbased linear arithmetic solver that can be integrated efficiently in the DPLL(T) framework. The new solver improves over existing approaches by enabling fast backtracking, supporting a priori simplification to reduce the problem size, and providing an efficient form
Local Reasoning about Programs that Alter Data Structures
, 2001
"... We describe an extension of Hoare's logic for reasoning about programs that alter data structures. We consider a lowlevel storage model based on a heap with associated lookup, update, allocation and deallocation operations, and unrestricted address arithmetic. The assertion language is ba ..."
Abstract

Cited by 324 (28 self)
 Add to MetaCart
We describe an extension of Hoare's logic for reasoning about programs that alter data structures. We consider a lowlevel storage model based on a heap with associated lookup, update, allocation and deallocation operations, and unrestricted address arithmetic. The assertion language
Fuzzy logic and arithmetical hierarchy III.
"... Fuzzy logic is understood as a logic with a comparative and truthfunctional notion of truth. Arithmetical complexity of sets of tautologies (identically true sentences) and satisfiable sentences (sentences true in at least one interpretation) as well of sets of provable formulas of the most impo ..."
Abstract
 Add to MetaCart
Fuzzy logic is understood as a logic with a comparative and truthfunctional notion of truth. Arithmetical complexity of sets of tautologies (identically true sentences) and satisfiable sentences (sentences true in at least one interpretation) as well of sets of provable formulas of the most
The comprehension principle and arithmetic in fuzzy logic
"... We investigate a theory of property which satisfies what Myhill called Frege’s principle, and we examine how much arithmetic we can develop by it. We concentrate the case of the set theory H with the comprehension principle in Lukasiewicz infinitevalued predicate logic∀L, and we highlight two featu ..."
Abstract
 Add to MetaCart
We investigate a theory of property which satisfies what Myhill called Frege’s principle, and we examine how much arithmetic we can develop by it. We concentrate the case of the set theory H with the comprehension principle in Lukasiewicz infinitevalued predicate logic∀L, and we highlight two
Reasoning within Fuzzy Description Logics
 Journal of Artificial Intelligence Research
, 2001
"... Description Logics (DLs) are suitable, wellknown, 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, wellknown, 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
Ruleplusexception model of classification learning
 Psychological Review
, 1994
"... The authors propose a ruleplusexception model (RULEX) of classification learning. According to RULEX, people learn to classify objects by forming simple logical rules and remembering occasional exceptions to those rules. Because the learning process in RULEX is stochastic, the model predicts that ..."
Abstract

Cited by 287 (19 self)
 Add to MetaCart
The authors propose a ruleplusexception model (RULEX) of classification learning. According to RULEX, people learn to classify objects by forming simple logical rules and remembering occasional exceptions to those rules. Because the learning process in RULEX is stochastic, the model predicts
A Scheme for Integrating Concrete Domains into Concept Languages
, 1991
"... A drawback which concept languages based on klone have is that all the terminological knowledge has to be defined on an abstract logical level. In many applications, one would like to be able to refer to concrete domains and predicates on these domains when defining concepts. Examples for such conc ..."
Abstract

Cited by 280 (22 self)
 Add to MetaCart
A drawback which concept languages based on klone have is that all the terminological knowledge has to be defined on an abstract logical level. In many applications, one would like to be able to refer to concrete domains and predicates on these domains when defining concepts. Examples
Results 1  10
of
11,042