778 search results - page 65 / 156 » Expressiveness and complexity of graph logic |
113
click to vote
SEMWEB
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. This paper presents a decidable fragment for combining ontologies and rules in order-sorted logic programming. We describe ordersorted logic programming with sort, predic...
104
click to vote
LPAR
2007
Springer
15 years 6 months ago
2007
Springer
We investigate the possibility of developing a decidable logic which allows expressing a large variety of real world specifications. The idea is to define a decidable subset of m...
106
click to vote
PODS
1991
ACM
15 years 4 months ago
1991
ACM
A novel approach is proposed for ezpresaing and computing eficienily a large cla88 of problem8, including jinding the shortest path in a graph, that were previously considered imp...
106
Voted
AMAST
2008
Springer
15 years 2 months ago
2008
Springer
Many complex analysis problems can be most clearly and easily specified as logic rules and queries, where rules specify how given facts can be combined to infer new facts, and quer...
ICDAR
2009
IEEE
15 years 7 months ago
2009
IEEE
In this paper, we make an attempt to use Inductive Logic Programming (ILP) to automatically learn non trivial descriptions of symbols, based on a formal description. This work is ...