4617 search results - page 373 / 924 » Automation of Diagrammatic Reasoning |
206
click to vote
ASP
2001
Springer
15 years 10 months ago
2001
Springer
This paper presents a novel application of answer set programming to concept learning in nonmonotonic logic programs. Given an extended logic program as a background theory, we in...
173
click to vote
CL
2000
Springer
15 years 10 months ago
2000
Springer
We use Kleene algebra with tests to verify a wide assortment of common compiler optimizations, including dead code elimination, common subexpression elimination, copy propagation,...
171
click to vote
CL
2000
Springer
15 years 10 months ago
2000
Springer
Boolean circuits offer a natural, structured, and compact representation of Boolean functions for many application domains. In this paper a tableau method for solving satisfiabilit...
159
Voted
EWCBR
2000
Springer
15 years 10 months ago
2000
Springer
This paper presents an approach to realize a case retrieval engine on top of a relational database. In a nutshell the core idea is to approximate a similarity-based retrieval with ...
169
click to vote
LICS
1998
IEEE
15 years 10 months ago
1998
IEEE
In this paper we describe the promoted tyft tyxt rule format for de ning higher-order languages. The rule format is a generalization of Groote and Vaandrager's tyft tyxt form...