846 search results - page 27 / 170 » On the Computational Complexity of Spatio-Temporal Logics |
JCST
2010
14 years 4 months ago
2010
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
JAIR
2007
14 years 9 months ago
2007
This work is a contribution to prioritized reasoning in logic programming in the presence of preference relations involving atoms. The technique, providing a new interpretation fo...
LICS
2006
IEEE
15 years 3 months ago
2006
IEEE
We give a semantic characterization of bounded complexity proofs. We introduce the notion of obsessional clique in the relational model of linear logic and show that restricting t...
79
Voted
PKDD
2004
Springer
15 years 2 months ago
2004
Springer
One of the most important operations involving Data Mining patterns is computing their similarity. In this paper we present a general framework for comparing both simple and comple...
ECSQARU
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. There are a number of frameworks for modelling argumentation in logic. They incorporate a formal representation of individual arguments and techniques for comparing conï¬...