Sciweavers

2519 search results - page 194 / 504
» Reasoning with Textual Cases
Sort
View
TIME
2006
IEEE
16 years 17 days ago
Ultimately Periodic Simple Temporal Problems (UPSTPs)
In this paper, we consider quantitative temporal or spatial constraint networks whose constraints evolve over time in an ultimately periodic fashion. These constraint networks are...
Jean-François Condotta, Gérard Ligoz...
TPHOL
2006
IEEE
16 years 17 days ago
ACL2
This case study shows how ACL2 can be used to reason about the real and complex numbers, using non-standard analysis. It describes some modifications to ACL2 that include the irr...
Ruben Gamboa
ICCBR
2005
Springer
16 years 11 hour ago
Using CBR to Select Solution Strategies in Constraint Programming
Constraint programming is a powerful paradigm that offers many different strategies for solving problems. Choosing a good strategy is difficult; choosing a poor strategy wastes r...
Cormac Gebruers, Brahim Hnich, Derek G. Bridge, Eu...
ASP
2001
Springer
15 years 11 months ago
Well Founded Semantics as Two dimensional Here and There
This workpresents a newlogical characterization of well foundedsemanticsthat provides, as interesting innovation, a fully semantic-oriented treatment of programconnectives without...
Pedro Cabalar
CSL
2000
Springer
15 years 11 months ago
Bounded Arithmetic and Descriptive Complexity
We study definability of languages in arithmetic and the free monoid by bounded versions of fixed-point and transitive-closure logics. In particular we give logical characterisat...
Achim Blumensath