Sciweavers

1322 search results - page 235 / 265
» Unsound Theorem Proving
Sort
View
AMAI
2007
Springer
13 years 7 months ago
Decision procedures for extensions of the theory of arrays
The theory of arrays, introduced by McCarthy in his seminal paper “Toward a mathematical science of computation”, is central to Computer Science. Unfortunately, the theory alo...
Silvio Ghilardi, Enrica Nicolini, Silvio Ranise, D...
AMAI
2007
Springer
13 years 7 months ago
A new modal logic for reasoning about space: spatial propositional neighborhood logic
It is widely accepted that spatial reasoning plays a central role in artificial intelligence, for it has a wide variety of potential applications, e.g., in robotics, geographical...
Antonio Morales, Isabel Navarrete, Guido Sciavicco
CORR
2008
Springer
93views Education» more  CORR 2008»
13 years 7 months ago
Succinctness of the Complement and Intersection of Regular Expressions
Abstract. We study the succinctness of the complement and intersection of regular expressions. In particular, we show that when constructing a regular expression defining the compl...
Wouter Gelade, Frank Neven
CORR
2008
Springer
143views Education» more  CORR 2008»
13 years 7 months ago
On combinations of local theory extensions
Many problems in mathematics and computer science can be reduced to proving the satisfiability of conjunctions of literals in a background theory which is often the extension of a ...
Viorica Sofronie-Stokkermans
DAM
2008
84views more  DAM 2008»
13 years 7 months ago
Edge-splittings preserving local edge-connectivity of graphs
Let G = (V + s, E) be a 2-edge-connected graph with a designated vertex s. A pair of edges rs, st is called admissible if splitting off these edges (replacing rs and st by rt) pre...
Zoltán Szigeti