1950 search results - page 10 / 390 » Lambda-Free Logical Frameworks |
ICFP
2003
ACM
14 years 7 months ago
2003
ACM
Under the widely believed conjecture P=NP, NP-complete problems cannot be solved exactly using efficient polynomial time algorithms. Furthermore, any instance of a NP-complete pro...
LOPSTR
2009
Springer
14 years 1 months ago
2009
Springer
We show how to combine the two most powerful approaches for automated termination analysis of logic programs (LPs): the direct approach which operates directly on LPs and the trans...
ICTAI
2007
IEEE
14 years 1 months ago
2007
IEEE
In this paper we developed an Inductive Logic Programming (ILP) based framework ExOpaque that is able to extract a set of Horn clauses from an arbitrary opaque machine learning mo...
CICLING
2004
Springer
14 years 24 days ago
2004
Springer
Abstract. One major goal of human computer interfaces is to simplify the communication task. Traditionally, users have been restricted to the language of computers for this task. W...
WWW
2008
ACM
14 years 8 months ago
2008
ACM
In this paper, we incorporate concrete domain and action theory into a very expressive Description Logic (DL), called ALCQO. Notably, this extension can significantly augment the ...