156 search results - page 17 / 32 » Decidability and Undecidability in Probability Logic |
LPAR
2010
Springer
13 years 6 months ago
2010
Springer
Data trees and data words have been studied extensively in connection with XML reasoning. These are trees or words that, in addition to labels from a finite alphabet, carry labels ...
TABLEAUX
2005
Springer
14 years 2 months ago
2005
Springer
In description logics (DLs), concrete domains are used for defining concepts based on concrete qualities of their instances such as the weight, age, duration, and spatial extensio...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Open Answer Set Programming (OASP) is an attractive framework for integrating ontologies and rules. In general OASP is undecidable. In previous work we provided a tableau-based alg...
GVD
2004
13 years 10 months ago
2004
Abstract. Checking the consistency of query conditions is an old problem, and there are already many proposed solutions. Since the problem is in general undecidable, there is not a...
FOSSACS
2010
Springer
14 years 3 months ago
2010
Springer
Abstract. Spatial logics have been introduced to reason about distributed computation in models for concurrency. We first define a spatial logic for a general class of infinite-...