Sciweavers

846 search results - page 13 / 170
» On the Computational Complexity of Spatio-Temporal Logics
Sort
View
IJSI
2010
84views more  IJSI 2010»
13 years 5 months ago
Computational Complexity and Anytime Algorithm for Inconsistency Measurement
Measuring inconsistency degrees of inconsistent knowledge bases is an important problem as it provides context information for facilitating inconsistency handling. Many methods hav...
Yue Ma, Guilin Qi, Guohui Xiao, Pascal Hitzler, Zu...
LOGCOM
2010
120views more  LOGCOM 2010»
13 years 5 months ago
Arithmetical Complexity of First-order Predicate Fuzzy Logics Over Distinguished Semantics
All promiment examples of first-order predicate fuzzy logics are undecidable. This leads to the problem of the arithmetical complexity of their sets of tautologies and satisfiab...
Franco Montagna, Carles Noguera
IAT
2009
IEEE
14 years 2 months ago
Computing Information Minimal Match Explanations for Logic-Based Matchmaking
Abstract—In semantic matchmaking processes it is often useful, when the obtained match is not full, to provide explanations for the mismatch, to leverage further interaction and/...
Tommaso Di Noia, Eugenio Di Sciascio, Francesco M....
COCO
2008
Springer
129views Algorithms» more  COCO 2008»
13 years 9 months ago
Constraint Logic: A Uniform Framework for Modeling Computation as Games
We introduce a simple game family, called Constraint Logic, where players reverse edges in a directed graph while satisfying vertex in-flow constraints. This game family can be in...
Erik D. Demaine, Robert A. Hearn
CONCUR
2007
Springer
14 years 1 months ago
Linear Time Logics Around PSL: Complexity, Expressiveness, and a Little Bit of Succinctness
Abstract. We consider linear time temporal logic enriched with semiextended regular expressions through various operators that have been proposed in the literature, in particular i...
Martin Lange