Sciweavers

60 search results - page 9 / 12
» Practical First-Order Temporal Reasoning
Sort
View
TACAS
2010
Springer
255views Algorithms» more  TACAS 2010»
13 years 6 months ago
Satisfiability Modulo the Theory of Costs: Foundations and Applications
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...
Alessandro Cimatti, Anders Franzén, Alberto...
CSL
2009
Springer
14 years 1 months ago
Upper Bounds on Stream I/O Using Semantic Interpretations
This paper extends for the first time semantic interpretation tools to infinite data in order to ensure Input/Output upper bounds on first order Haskell like programs on streams...
Marco Gaboardi, Romain Péchoux
DLOG
2009
13 years 6 months ago
What Happened to Bob? Semantic Data Mining of Context Histories
We report on event recognition within the life logging application IYOUIT for the automatic creation of static diary-like Blogs. Based on the qualitative context histories produced...
Michael Wessel, Marko Luther, Ralf Möller
ECAI
2004
Springer
14 years 1 months ago
Guiding a Theorem Prover with Soft Constraints
Attempts to use finite models to guide the search for proofs by resolution and the like in first order logic all suffer from the need to trade off the expense of generating and m...
John K. Slaney, Arnold Binas, David Price
SEMWEB
2010
Springer
13 years 6 months ago
Representing and Querying Validity Time in RDF and OWL: A Logic-Based Approach
RDF(S) and OWL 2 currently support only static ontologies. In practice, however, the truth of statements often changes with time, and Semantic Web applications often need to repres...
Boris Motik