Sciweavers

232 search results - page 30 / 47
» Completeness and Decidability in Sequence Logic
Sort
View
FAC
2008
92views more  FAC 2008»
14 years 9 months ago
Capture-avoiding substitution as a nominal algebra
Substitution is fundamental to the theory of logic and computation. Is substitution something that we define on syntax on a case-by-case basis, or can we turn the idea of substitut...
Murdoch James Gabbay, Aad Mathijssen
DLOG
2007
14 years 11 months ago
A Proof Theory for DL-Lite
Abstract. In this work we propose an alternative approach to inference in DLLite, based on a reduction to reasoning in an extension of function-free Horn Logic (EHL). We develop a ...
Diego Calvanese, Evgeny Kharlamov, Werner Nutt
LPAR
2010
Springer
14 years 7 months ago
The Complexity of Partial-Observation Parity Games
We consider two-player zero-sum games on graphs. On the basis of the information available to the players these games can be classified as follows: (a) partial-observation (both p...
Krishnendu Chatterjee, Laurent Doyen
SGAI
2007
Springer
15 years 3 months ago
Learning Sets of Sub-Models for Spatio-Temporal Prediction
In this paper we describe a novel technique which implements a spatiotemporal model as a set of sub-models based on first order logic. These sub-models model different, typicall...
Andrew Bennett, Derek R. Magee
IGPL
1998
97views more  IGPL 1998»
14 years 9 months ago
Towards Structurally-Free Theorem Proving
Is it possible to compute in which logics a given formula is deducible? The aim of this paper is to provide a formal basis to answer positively this question in the context of sub...
Marcelo Finger