Sciweavers

365 search results - page 49 / 73
» First-order logical filtering
Sort
View
KBSE
1998
IEEE
14 years 3 days ago
Towards the Automated Debugging and Maintenance of Logic-based Requirements Models
In this paper we describe a tools environment which automates the validation and maintenance of a requirements model written in many-sorted first order logic. We focus on: a trans...
T. L. McCluskey, Margaret Mary West
APAL
2010
88views more  APAL 2010»
13 years 8 months ago
Nonstandard arithmetic and recursive comprehension
First order reasoning about hyperintegers can prove things about sets of integers. In the author's paper Nonstandard Arithmetic and Reverse Mathematics, Bulletin of Symbolic L...
H. Jerome Keisler
APAL
2008
92views more  APAL 2008»
13 years 8 months ago
The complexity of random ordered structures
We show that for random bit strings, Up(n), with probability, p = 1 2 , the firstorder quantifier depth D(Up(n)) needed to distinguish non-isomorphic structures is (lg lg n), with...
Joel H. Spencer, Katherine St. John
LOBJET
2008
104views more  LOBJET 2008»
13 years 7 months ago
Une approche formelle de la reconfiguration dynamique
Self-adapting software adapts its behavior in an autonomic way, by dynamically adding, suppressing and recomposing components, and by the use of computational reflection. One way t...
M. Simonot, M. Aponte
ICDT
2009
ACM
125views Database» more  ICDT 2009»
14 years 8 months ago
How big must complete XML query languages be?
Marx and de Rijke have shown that the navigational core of the w3c XML query language XPath is not first-order complete ? that is it cannot express every query definable in firsto...
Clemens Ley, Michael Benedikt