Sciweavers

300 search results - page 21 / 60
» An extension of the Cayley-Sylvester formula
Sort
View
JAIR
2011
166views more  JAIR 2011»
13 years 2 months ago
Decidability and Undecidability Results for Propositional Schemata
We define a logic of propositional formula schemata adding to the syntax of propositional logic indexed propositions (e.g., pi) and iterated connectives ∨ or ∧ ranging over i...
Vincent Aravantinos, Ricardo Caferra, Nicolas Pelt...
TIT
2010
129views Education» more  TIT 2010»
13 years 2 months ago
Random access in wireless networks with overlapping cells
We study cellular-like wireless networks in which the cells may overlap substantially, and a common channel is used for all cells. Thus, transmissions intended for one destination ...
Gam D. Nguyen, Jeffrey E. Wieselthier, Anthony Eph...
LFCS
2009
Springer
14 years 2 months ago
A Clausal Approach to Proof Analysis in Second-Order Logic
This work defines an extension CERES2 of the first-order cut-elimination method CERES to the subclass of sequent calculus proofs in second-order logic using quantifier-free comp...
Stefan Hetzl, Alexander Leitsch, Daniel Weller, Br...
PODS
2000
ACM
102views Database» more  PODS 2000»
14 years 8 days ago
Linear Approximation of Planar Spatial Databases Using Transitive-Closure Logic
We consider spatial databases in the plane that can be defined by polynomial constraint formulas. Motivated by applications in geographic information systems, we investigate line...
Floris Geerts, Bart Kuijpers
LPAR
2010
Springer
13 years 6 months ago
On the Complexity of Model Expansion
Abstract. We study the complexity of model expansion (MX), which is the problem of expanding a given finite structure with additional relations to produce a finite model of a giv...
Antonina Kolokolova, Yongmei Liu, David G. Mitchel...