Sciweavers

265 search results - page 52 / 53
» Weakly Algebraizable Logics
Sort
View
CASC
2006
Springer
128views Mathematics» more  CASC 2006»
13 years 11 months ago
New Domains for Applied Quantifier Elimination
We address various aspects of our computer algebra-based computer logic system redlog. There are numerous examples in the literature for successful applications of redlog to practi...
Thomas Sturm
PVLDB
2010
151views more  PVLDB 2010»
13 years 5 months ago
Advanced Processing for Ontological Queries
Ontology-based data access is a powerful form of extending database technology, where a classical extensional database (EDB) is enhanced by an ontology that generates new intensio...
Andrea Calì, Georg Gottlob, Andreas Pieris
FTRTFT
1998
Springer
13 years 11 months ago
Fair Synchronous Transition Systems and Their Liveness Proofs
We present a compositional semantics of synchronous systems that captures both safety and progress properties of such systems. The fair synchronous transitions systems (fsts) mode...
Amir Pnueli, Natarajan Shankar, Eli Singerman
DLS
2008
149views Languages» more  DLS 2008»
13 years 9 months ago
Gradual typing with unification-based inference
Static and dynamic type systems have well-known strengths and weaknesses. Gradual typing provides the benefits of both in a single language by giving the programmer control over w...
Jeremy G. Siek, Manish Vachharajani
ENTCS
2008
137views more  ENTCS 2008»
13 years 7 months ago
Computerizing Mathematical Text with MathLang
Mathematical texts can be computerized in many ways that capture differing amounts of the mathematical meaning. At one end, there is document imaging, which captures the arrangeme...
Fairouz Kamareddine, J. B. Wells