Results 1  10
of
6,753
LOGICAL FORMULAE
"... • Ubiquitous Computing, and modelling it • Space and Motion in large systems • Conclusion 2 PARTS OF THE TALK • What are Informatic Models? How do they fit together? • Ubiquitous Computing, and modelling it • Space and Motion in large systems • Conclusion 3 An informatic model with behaviour and lay ..."
Abstract
 Add to MetaCart
• Ubiquitous Computing, and modelling it • Space and Motion in large systems • Conclusion 2 PARTS OF THE TALK • What are Informatic Models? How do they fit together? • Ubiquitous Computing, and modelling it • Space and Motion in large systems • Conclusion 3 An informatic model with behaviour and layers Entities in a model explain, or are realised by, entities in the physical world—as in natural science.
Inductive Inference of Logic Formulas
"... This paper continues the research of the synthesis of formulas of manysorted first order predicate logic with equality from finite examples. Necessary and sufficient conditions for synthesisability and uniformity are given. ..."
Abstract
 Add to MetaCart
This paper continues the research of the synthesis of formulas of manysorted first order predicate logic with equality from finite examples. Necessary and sufficient conditions for synthesisability and uniformity are given.
From Semantic Graphs to Logic Formulae
, 2009
"... We present a general twostep algorithm which transforms a graph expressing the semantic dependencies between the words of an utterance into logic formulae representing the different semantic interpretations of the utterance. The algorithm focuses on the scopal elements of the utterance, i.e. quanti ..."
Abstract
 Add to MetaCart
We present a general twostep algorithm which transforms a graph expressing the semantic dependencies between the words of an utterance into logic formulae representing the different semantic interpretations of the utterance. The algorithm focuses on the scopal elements of the utterance, i
Deciding Provability of Linear Logic Formulas
 Advances in Linear Logic
, 1994
"... Introduction There are many interesting fragments of linear logic worthy of study in their own right, most described by the connectives which they employ. Full linear logic includes all the logical connectives, which come in three dual pairs: the exponentials ! and ?, the additives & and \Phi, ..."
Abstract

Cited by 29 (0 self)
 Add to MetaCart
Grant CCR9224858. lincoln@csl.sri.com http://www.csl.sri.com/lincoln/lincoln.html Patrick Lincoln For the most part we will consider fragments of linear logic built up using these connectives in any combination. For example, full linear logic formulas may employ any connective, while multiplic
Characterizing Conclusive Approximations by Logical Formulae
"... Considering an initial set of terms E, a rewriting relation R and a goal set of terms Bad, reachability analysis in term rewriting tries to answer to the following question: does there exists at least one term of Bad that can be reached from E using the rewriting relation R? Some of the approaches t ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
characterization of conclusive approximations by logical formulae generated from a new kind of automata called symbolic tree automata. Solving a such formula leads automatically to a conclusive approximation without extra technical parameters.
Generalised Unification of Temporal Logic Formulas
, 1999
"... Given two temporal logic formulas, g and h, we wish to know whether there is a modification, m, we can make to h so that g =) h. This problem has important applications in hardware verification, where finding such modifications efficiently is important for an inferencing system. The temporal logic u ..."
Abstract
 Add to MetaCart
Given two temporal logic formulas, g and h, we wish to know whether there is a modification, m, we can make to h so that g =) h. This problem has important applications in hardware verification, where finding such modifications efficiently is important for an inferencing system. The temporal logic
Finite differencing of logical formulas for static analysis
 IN PROC. 12TH ESOP
, 2003
"... This paper concerns mechanisms for maintaining the value of an instrumentationpredicate (a.k.a. derived predicate or view), defined via a logical formula over core predicates, in response to changes in the values of the core predicates. It presents an algorithm fortransforming the instrumentation p ..."
Abstract

Cited by 37 (17 self)
 Add to MetaCart
This paper concerns mechanisms for maintaining the value of an instrumentationpredicate (a.k.a. derived predicate or view), defined via a logical formula over core predicates, in response to changes in the values of the core predicates. It presents an algorithm fortransforming the instrumentation
Dynamic Logic
 Handbook of Philosophical Logic
, 1984
"... ed to be true under the valuation u iff there exists an a 2 N such that the formula x = y is true under the valuation u[x=a], where u[x=a] agrees with u everywhere except x, on which it takes the value a. This definition involves a metalogical operation that produces u[x=a] from u for all possibl ..."
Abstract

Cited by 1012 (7 self)
 Add to MetaCart
ed to be true under the valuation u iff there exists an a 2 N such that the formula x = y is true under the valuation u[x=a], where u[x=a] agrees with u everywhere except x, on which it takes the value a. This definition involves a metalogical operation that produces u[x=a] from u for all
A Generator for Description Logic Formulas
"... We introduce a schema for generating random formulas for different description logics, which extends an existing pattern for modal logics. Using the DL reasoners FaCT and Racer, we test the difficulty of these formulas, and it turns out that the properties that make a formula in an expressive DL har ..."
Abstract
 Add to MetaCart
We introduce a schema for generating random formulas for different description logics, which extends an existing pattern for modal logics. Using the DL reasoners FaCT and Racer, we test the difficulty of these formulas, and it turns out that the properties that make a formula in an expressive DL
Results 1  10
of
6,753