Sciweavers

1331 search results - page 117 / 267
» Description logic reasoning using the PTTP approach
Sort
View
AISC
1998
Springer
15 years 10 months ago
Reasoning About Coding Theory: The Benefits We Get from Computer Algebra
The use of computer algebra is usually considered beneficial for mechanised reasoning in mathematical domains. We present a case study, in the application domain of coding theory, ...
Clemens Ballarin, Lawrence C. Paulson
KBSE
2005
IEEE
15 years 12 months ago
Prufrock: a framework for constructing polytypic theorem provers
Current formal software engineering methodologies provide a vast array of languages for specifying correctness properties, as well as a wide assortment automated tools that aid in...
Justin Ward, Garrin Kimmell, Perry Alexander
POLICY
2005
Springer
15 years 12 months ago
Managing the Policies of Non-Technical Users in a Dynamic World
In this paper, we describe the use of description logic as the basis for a policy representation language and show how it is used in our implementation of a policy managed pervasi...
Tim Owen, Ian Wakeman, Bill Keller, Julie Weeds, D...
LMCS
2006
98views more  LMCS 2006»
15 years 6 months ago
Approximate reasoning for real-time probabilistic processes
We develop a pseudo-metric analogue of bisimulation for generalized semi-Markov processes. The kernel of this pseudo-metric corresponds to bisimulation; thus we have extended bisi...
Vineet Gupta, Radha Jagadeesan, Prakash Panangaden
LICS
1999
IEEE
15 years 10 months ago
First-Order Logic vs. Fixed-Point Logic in Finite Set Theory
The ordered conjecture states that least fixed-point logic LFP is strictly more expressive than first-order logic FO on every infinite class of ordered finite structures. It has b...
Albert Atserias, Phokion G. Kolaitis