Sciweavers

895 search results - page 155 / 179
» A Spectrum of Applications of Automated Reasoning
Sort
View
LICS
2003
IEEE
15 years 3 months ago
Polynomial-time Algorithms from Ineffective Proofs
We present a constructive procedure for extracting polynomial-time realizers from ineffective proofs of Π0 2theorems in feasible analysis. By ineffective proof we mean a proof wh...
Paulo Oliva
RSP
2003
IEEE
169views Control Systems» more  RSP 2003»
15 years 3 months ago
Rapid Prototyping and Incremental Evolution Using SLAM
The paper shows the outlines of the SLAM system and how its design is suitable for automating rapid prototyping. The system includes a very expressive object oriented specificati...
Ángel Herranz-Nieva, Juan José Moren...
ECSQARU
2003
Springer
15 years 3 months ago
Propositional Fusion Rules
In previous papers, we have presented a logic-based framework for merging structured news reports [14, 16, 15]. Structured news reports are XML documents, where the text entries ar...
Anthony Hunter, Rupert Summerton
ICLP
2003
Springer
15 years 3 months ago
Uniform Equivalence of Logic Programs under the Stable Model Semantics
In recent research on nonmonotonic logic programming, repeatedly strong equivalence of logic programs P and Q has been considered, which holds if the programs P ∪ R and Q ∪ R h...
Thomas Eiter, Michael Fink
GIS
2009
ACM
15 years 2 months ago
In-network query processing in mobile P2P databases
The in-network query processing paradigm in sensor networks postulates that a query is routed among sensors and collects the answers from the sensors on its trajectory. It works f...
Bo Xu, Fatemeh Vafaee, Ouri Wolfson