Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

5

SAS
2004
Springer

favoriteEmaildiscussreport

84views Formal Methods» more SAS 2004»

Closed and Logical Relations for Over- and Under-Approximation of Powersets

13 years 9 months ago

Closed and Logical Relations for Over- and Under-Approximation of Powersets

Download people.cis.ksu.edu

David A. Schmidt

Real-time Traffic

Formal Methods | SAS 2004 |

claim paper

Related Content

» Comparing the Succinctness of Monadic Query Languages over Finite Trees

» A Logic on Subobjects and Recognizability

» Model Checking FOR over OneCounter Processes and beyond

» ConsequenceDriven Reasoning for Horn SHIQ Ontologies

» The Lattice Structure of Sets of Surjective HyperOperations

» Knowledge Representation using Schema Tuple Queries

» Answering NonMonotonic Queries in Relational Data Exchange

» Quantified Positive Temporal Constraints

» The Closure of Monadic NP

Post Info
More Details (n/a)

Added	02 Jul 2010
Updated	02 Jul 2010
Type	Conference
Year	2004
Where	SAS
Authors	David A. Schmidt

Comments (0)