Sciweavers

217 search results - page 13 / 44
» A Logic for Approximate First-Order Reasoning
Sort
View
FOIS
2006
13 years 9 months ago
Approximation of Ontologies in CASL
In this paper we present methods to generate a Description Logic (DL) theory from a given First Order Logic (FOL) theory, such that each DL axiom is entailed by the given FOL theor...
Klaus Lüttich
CADE
1994
Springer
13 years 11 months ago
PROTEIN: A PROver with a Theory Extension INterface
Abstract. PROTEIN (PROver with a Theory Extension INterface) is a PTTPbased first order theorem prover over built-in theories. Besides various standardrefinements knownformodelelim...
Peter Baumgartner, Ulrich Furbach
ISMIS
1994
Springer
13 years 11 months ago
Reasoning About the Safety of Information: From Logical Formalization to Operational Definition
We assume that safety of information stored in a database depends on the reliability of the agents who have performed the insertions in the database. We present a logic S to repres...
Laurence Cholvy, Robert Demolombe, Andrew J. I. Jo...
CADE
2004
Springer
14 years 7 months ago
Lambda Logic
Lambda logic is the union of first order logic and lambda calculus. We prove basic metatheorems for both total and partial versions of lambda logic. We use lambda logic to state a...
Michael Beeson
ENTCS
2006
94views more  ENTCS 2006»
13 years 7 months ago
Reasoning About Partial Functions in the Formal Development of Programs
Partial functions and operators are used extensively in the formal development of programs and thus development methods have to clarify how to reason about them. There are a numbe...
Cliff B. Jones