4617 search results - page 628 / 924 » Automation of Diagrammatic Reasoning |
250
click to vote
KR
2010
Springer
15 years 5 months ago
2010
Springer
Measuring the inconsistency degree of a knowledge base can help us to deal with inconsistencies. Several inconsistency measures have been given under different multi-valued semant...
216
Voted
LICS
2010
IEEE
15 years 5 months ago
2010
IEEE
We prove that fixed-point logic with counting captures polynomial time on all classes of graphs with excluded minors. That is, for every class C of graphs such that some graph H is...
197
Voted
LICS
2010
IEEE
15 years 5 months ago
2010
IEEE
Let R be a class of generators of node-labelled infinite trees, and L be a logical language for describing correctness properties of these trees. Given R R and L, we say that R ...
226
Voted
LICS
2010
IEEE
15 years 5 months ago
2010
IEEE
The universal-algebraic approach has proved a powerful tool in the study of the computational complexity of constraint satisfaction problems (CSPs). This approach has previously b...
180
Voted
LPAR
2010
Springer
15 years 5 months ago
2010
Springer
We present a sound and complete model of lambda-calculus reductions based on structures inspired by modal logic (closely related to Kripke structures). Accordingly we can construct...