Sciweavers

232 search results - page 6 / 47
» Completeness and Decidability in Sequence Logic
Sort
View
WOLLIC
2009
Springer
14 years 2 months ago
Sound and Complete Tree-Sequent Calculus for Inquisitive Logic
Abstract. We introduce a tree-sequent calculus for inquisitive logic (Groenendijk 2008) as a special form of labelled deductive system (Gabbay 1996). In particular, we establish th...
Katsuhiko Sano
CSL
2006
Springer
13 years 11 months ago
Reasoning About States of Probabilistic Sequential Programs
A complete and decidable propositional logic for reasoning about states of probabilistic sequential programs is presented. The state logic is then used to obtain a sound Hoare-styl...
Rohit Chadha, Paulo Mateus, Amílcar Sernada...
DKE
2007
136views more  DKE 2007»
13 years 7 months ago
Deciding XPath containment with MSO
XPath is the standard language for addressing parts of an XML document. We present a sound and complete decision procedure for containment of XPath queries. The considered XPath f...
Pierre Genevès, Nabil Layaïda
ALP
1994
Springer
13 years 11 months ago
A Logic for Variable Aliasing in Logic Programs
This paper introduces a logic for a class of properties - in particular variable aliasing - used in static analysis of logic programs. The logic is shown to be sound, complete and ...
Elena Marchiori
FSS
2010
119views more  FSS 2010»
13 years 6 months ago
Algebraic and proof-theoretic characterizations of truth stressers for MTL and its extensions
Extensions of monoidal t-norm logic MTL and related fuzzy logics with truth stresser modalities such as globalization and “very true” are presented here both algebraically in ...
Agata Ciabattoni, George Metcalfe, Franco Montagna