2035 search results - page 312 / 407 » On the complexity of stratified logics |
108
click to vote
IJCAI
2003
15 years 2 months ago
2003
Refinement operators for theories avoid the problems related to the myopia of many relational learning algorithms based on the operators that refine single clauses. However, the n...
100
Voted
AAAI
1993
15 years 2 months ago
1993
Roughly speaking, adequatness is the property of a theorem proving method to solve simpler problems faster than more difficult ones. Automated inferencing methods are often not ad...
101
Voted
IJCAI
1993
15 years 2 months ago
1993
agent-oriented system. We show the complexity to be linear time for one of these logics and polynomial time for another, thus providing encouraging results with respect to the prac...
89
Voted
IJCAI
1989
15 years 1 months ago
1989
Usually, semantics of inheritance networks is specified indirectly through a translation into one of the standard logical formalisms. Since such translation involves an algorithmi...
119
Voted
FSTTCS
2008
Springer
15 years 1 months ago
2008
Springer
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...