• 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.

This paper continues the research of the synthesis of formulas of many-sorted first order predicate logic with equality from finite examples. Necessary and sufficient conditions for synthesisability and uniformity are given.

We present a general two-step 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

Grant CCR-9224858. 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

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.

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

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

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

Abstract not found

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