571 search results - page 15 / 115 » Domain Theory in Logical Form |
78
Voted
IJCAI
1989
14 years 10 months ago
1989
In this paper, we address an issue that arises when the background knowledge used by explanationbased learning is incorrect. In particular, we consider the problems that can be ca...
101
click to vote
AAAI
2007
14 years 12 months ago
2007
Generality or refinement relations between different theories have important applications to generalization in inductive logic programming, refinement of ontologies, and coordin...
FORMATS
2010
Springer
14 years 7 months ago
2010
Springer
SMT solvers have traditionally been based on the DPLL(T) algorithm, where the driving force behind the procedure is a DPLL search over truth valuations. This traditional framework ...
CADE
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We extend our previous study of the automatic construction of isomorphic classification theorems for algebraic domains by considering the isotopy equivalence relation. Is...
ICDT
1990
ACM
15 years 1 months ago
1990
ACM
Ordinary logical implication is not enough for answering queries in a logic database, since especially negative information is only implicitly represented in the database state. M...