Sciweavers

27 search results - page 5 / 6
» The Modal Formula (...) Is Not First-Order Definable
Sort
View
SPLC
2008
14 years 11 months ago
Formal Modeling for Product Families Engineering
In this paper we propose a behavioural model, namely the Generalized Extended Modal Transition Systems, as a basis for the formalization of different notions of variability usuall...
Alessandro Fantechi, Stefania Gnesi
ICDT
2009
ACM
125views Database» more  ICDT 2009»
15 years 10 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
JANCL
2002
121views more  JANCL 2002»
14 years 9 months ago
Approximate coherence-based reasoning
ABSTRACT. It has long been recognized that the concept of inconsistency is a central part of commonsense reasoning. In this issue, a number of authors have explored the idea of rea...
Frédéric Koriche
APAL
2002
101views more  APAL 2002»
14 years 9 months ago
The logic of tasks
The paper introduces a semantics for the language of classical first order logic supplemented with the additional operators and . This semantics understands formulas as tasks. An ...
Giorgi Japaridze
DLOG
2009
14 years 7 months ago
Testing Provers on a Grid - Framework Description
Abstract. GridTest is a framework for testing automated theorem provers using randomly generated formulas. It can be used to run tests locally, in a single computer, or in a comput...
Carlos Areces, Daniel Gorín, Alejandra Lore...