31 Hits in 3.0 sec

Page 6711 of Mathematical Reviews Vol. , Issue 2004i [page]

2004 Mathematical Reviews  
Summary: “We describe a ‘modal style’ tableau algorithm that de- 2004i:03023 cides satisfiability for the clique guarded fragment.  ...  Carsten Butz (Copenhagen ) 2004i:03019 03B35 03B25 03B60 Hirsch, Colin (D-AACH-GI; Aachen) ; Tobies, Stephan (D-AACH-TI; Aachen) A tableau algorithm for the clique guarded fragment.  ... 

Complexity Results and Practical Algorithms for Logics in Knowledge Representation [article]

Stephan Tobies
2001 arXiv   pre-print
Finally, we describe a tableau algorithm for the clique guarded fragment (CGF), which we hope will serve as the basis for an efficient implementation of a CGF reasoner.  ...  We provide exact complexity results and a practical, tableau based algorithm for the DL SHIQ, which forms the basis of the highly optimized DL system iFaCT.  ...  for the clique guarded fragment of FOL, based on the same ideas usually found in algorithms for modal logics or DLs.  ... 
arXiv:cs/0106031v1 fatcat:rsp5lyc4pnfjrkqwwe5c2gqwwm

Page 9185 of Mathematical Reviews Vol. , Issue 2004k [page]

2004 Mathematical Reviews  
(115-129); Martin Giese, A model generation style completeness proof for constraint tableaux with superposition (130-144); Jan Hladik, Implementation and optimisation of a tableau algorithm for the guarded  ...  Subramani, An analysis of quantified linear pro- grams (265-277); Etsuji Tomita and Tomokazu Seki, An efficient branch-and-bound algorithm for finding a maximum clique (278- 289); Xizhong Zheng and George  ... 

Decidability of Plain and Hereditary History-Preserving Bisimilarity for BPP

Sibylle Fröschle
1999 Electronical Notes in Theoretical Computer Science  
Sec. 3 gives the tableau-based decision procedure for HPB and in Sec. 4 we state the coincidence result. The decision procedure for HHPB follows in Sec. 5.  ...  The decidability for HPB is not a new result.  ...  I also thank two of the anonymous referees for valuable comments  ... 
doi:10.1016/s1571-0661(05)80297-x fatcat:ntdhd3shzvedbkzlrr2jdcifou

Finite Model Reasoning in Expressive Fragments of First-Order Logic

Lidia Tendera
2017 Electronic Proceedings in Theoretical Computer Science  
Over the past two decades several fragments of first-order logic have been identified and shown to have good computational and algorithmic properties, to a great extent as a result of appropriately describing  ...  This applies most notably to the guarded fragment, where quantifiers are appropriately relativized by atoms, and the fragment defined by restricting the number of variables to two.  ...  E.g. more liberal guardedness conditions (loosely-or clique-guarded, packed fragment) and guarded fragments of other logics have been studied (guarded second order logic, Datalog LITE).  ... 
doi:10.4204/eptcs.243.4 fatcat:47pmommxorc7hbjp7y2v3fxiuu

A Tableaux Based Decision Procedure for a Broad Class of Hybrid Formulae with Binders [chapter]

Serenella Cerrito, Marta Cialdea Mayer
2011 Lecture Notes in Computer Science  
A preprocessing step, rewriting formulae into equisatisfiable ones, turns the calculus into a satisfiability decision procedure for the fragment HL(@, ↓) \2↓2, i.e. formulae in negation normal form where  ...  Indirect blocking is based on a partial order on the nodes of a tableau branch, which arranges them into a tree-like structure.  ...  A tableau calculus testing satisfiability of formulae in the constant-free clique guarded fragment has been proposed in [9] .  ... 
doi:10.1007/978-3-642-22119-4_10 fatcat:yc6a5ywchvhd5dqz2q5lwlklbu

Querying Guarded Fragments via Resolution [article]

Sen Zheng, Renate A. Schmidt
2020 arXiv   pre-print
As far as we know, this is the first practical decision procedure for answering and rewriting Boolean conjunctive queries over the guarded fragment and the loosely guarded fragment.  ...  Therefore, the problem of querying the (loosely) guarded fragment can be reduced to deciding the (loosely) guarded fragment and possibly irreducible query clauses, i.e., a clause that cannot derive any  ...  There are still many open problems: i) can Q-AR query more expressive guarded logics, such as guarded negation fragment, and clique guarded negation fragment, where one needs to cope with equality and  ... 
arXiv:2002.02228v2 fatcat:cp24u5vypzbbxjq4oq6r3p7ff4

Complexity of hybrid logics over transitive frames

Martin Mundhenk, Thomas Schneider, Thomas Schwentick, Volker Weber
2010 Journal of Applied Logic  
EXPTIME lower bound for the modal Until language.  ...  We show that satisfiability over transitive frames for the hybrid language extended with the downarrow operator ↓ is NEXPTIME-complete.  ...  Acknowledgements We thank Balder ten Cate, Massimo Franceschet, Maarten Marx, and an unknown referee for helpful suggestions, discussions, and comments.  ... 
doi:10.1016/j.jal.2010.08.004 fatcat:ahls6o6bgvcetpqgtqkj5syfbm

Complexity of monodic guarded fragments over linear and real time

Ian Hodkinson
2006 Annals of Pure and Applied Logic  
We show that the satisfiability problem for the monodic guarded, loosely guarded, and packed fragments of first-order temporal logic with equality is 2Exptime-complete for structures with arbitrary first-order  ...  We then show that for structures with finite first-order domains, these fragments are also 2Exptime-complete over real numbers time and hence over most of the commonly-used linear flows of time, including  ...  The clique-guarded fragment defined in [8] is a syntactic variant of it.  ... 
doi:10.1016/j.apal.2005.06.007 fatcat:nw5xsjjfyffijmaaarbo3q3nuu

A Tableau Based Decision Procedure for an Expressive Fragment of Hybrid Logic with Binders, Converse and Global Modalities

Serenella Cerrito, Marta Cialdea Mayer
2012 Journal of automated reasoning  
By means of a satisfiability preserving translation of formulae, the calculus can be turned into a satisfiability decision procedure for the fragment FHL \ 2↓2, i.e. formulae in negation normal form where  ...  Indirect blocking is based on a partial order on the nodes of a tableau branch, which arranges them into a tree-like structure.  ...  The authors wish to thank the anonymous reviewers of this paper for their comments and suggestions, and Rajeev Goré for helpful remarks on the content of this work.  ... 
doi:10.1007/s10817-012-9257-2 fatcat:2jrz2xxwunalpjfe6bh6bkn3j4

A brief history of algebraic logic from neat embeddings to rainbow constructions [article]

Tarek Sayed Ahmed
2015 arXiv   pre-print
We show that such results remain valid for cylindric algebras possesing relativized clique guarded representations that are only locally well behaved.  ...  The paper has a survey character but it contains new approaches to old ones.  ...  We end this section with the following theorem: In the sense of the previous theorem, the the clique guarded fragments, which are the n-variable fragments of first order order with clique (locally) guarded  ... 
arXiv:1508.05840v1 fatcat:xsyr345hgzf4natorz4ds6hy6q

Some approximations in Model Checking and Testing [article]

M.C. Gaudel and R. Lassaigne and F. Magniez and M. de Rougemont
2013 arXiv   pre-print
Model checking and testing are two areas with a similar goal: to verify that a system satisfies a property.  ...  All these methods guarantee some quality and efficiency of the verification.  ...  In [GPVW95] , the authors describe a tableau-based algorithm for obtaining an automaton from an LTL formula.  ... 
arXiv:1304.5199v1 fatcat:ytly2coo4jgfxerjndgyhm47gy

Saturation-based Boolean conjunctive query answering and rewriting for the guarded quantification fragments [article]

Sen Zheng, Renate A. Schmidt
2022 arXiv   pre-print
for the guarded, the loosely guarded and the clique guarded fragments.  ...  loosely guarded and the clique guarded fragments.  ...  , the loosely guarded and the clique guarded fragments.  ... 
arXiv:2208.05365v1 fatcat:upxkxqebkvaclddarilk63tx5i

An Introduction to Ontology-Based Query Answering with Existential Rules [chapter]

Marie-Laure Mugnier, Michaël Thomazo
2014 Lecture Notes in Computer Science  
for the former, and with guarded rules for the latter.  ...  The original algorithm for conjunctive query answering under guarded sets of rules performs a traditional forward chaining and stops it after a number of steps which is a function of the sizes of the rule  ... 
doi:10.1007/978-3-319-10587-1_6 fatcat:xxij2r5rgfd4jktds77a44l42m

Decidability of plain and hereditary history-preserving bisimilarity for BPP

Sibylle B. Fröschle, TUHH Universitätsbibliothek
B-The decidability of HHPB is a new result.  ...  We find that both notions are decidable for this class of infinite systems, and present tableau-based decision procedures.  ...  I also thank two of the anonymous referees for valuable comments  ... 
doi:10.15480/882.4048 fatcat:bwthzwdhn5allm37iufjpeylpm
« Previous Showing results 1 — 15 out of 31 results