778 search results - page 56 / 156 » Expressiveness and complexity of graph logic |
91
Voted
ESA
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Possibly the most famous algorithmic meta-theorem is Courcelle's theorem, which states that all MSO-expressible graph properties are decidable in linear time for gra...
106
click to vote
IJWGS
2006
15 years 16 days ago
2006
: This paper presents a systematic study of some major problems involved in the transformation of business process modelling languages to executable business process representation...
KR
2010
Springer
15 years 5 months ago
2010
Springer
Preference logics and AI preference representation languages are both concerned with reasoning about preferences on combinatorial domains, yet so far these two streams of research...
134
click to vote
KBS
2011
14 years 7 months ago
2011
Order-sorted logic is a useful tool for knowledge representation and reasoning because it enables representation of sorted terms and formulas along with partially ordered sorts (c...
99
Voted
ICCS
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. In this paper, we extend Simple Conceptual Graphs with Reiter’s default rules. The motivation for this extension came from the type of reasonings involved in an agronom...