232 search results - page 20 / 47 » Completeness and Decidability in Sequence Logic |
TABLEAUX
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We give an optimal (exptime), sound and complete tableaubased algorithm for deciding satisfiability with respect to a TBox in the logic ALCI using global state caching. ...
FLAIRS
2008
14 years 11 months ago
2008
We develop a formal system dealing `spatially' with certain aspects of uniformity and control during knowledge acquisition. To this end, we study an appropriate modality, whi...
ICLP
1989
Springer
1989
Springer
Complete and Efficient Methods for Supporting Side-effects in Independent/Restricted AND-Parallelism
15 years 28 days ago
It has been shown that it is possible to exploit Independent/Restricted And-parallelism in logic programs while retaining the conventional "don't know" semantics of...
JOLLI
2011
14 years 4 months ago
2011
We define and study a calculus of discontinuity, a version of displacement calculus, which is a logic of segmented strings in exactly the same sense that the Lambek calculus is a ...
FOSSACS
2004
Springer
15 years 2 months ago
2004
Springer
People often need to reason about policy changes before they are adopted. For example, suppose a website manager knows that users want to enter her site without going through the w...