3513 search results - page 278 / 703 » Super Logic Programs |
128
click to vote
ICFP
2003
ACM
16 years 4 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...
161
click to vote
ILP
2007
Springer
15 years 10 months ago
2007
Springer
In this chapter, we describe a view of statistical learning in the inductive logic programming setting based on kernel methods. The relational representation of data and background...
155
click to vote
DLOG
2003
15 years 5 months ago
2003
A description-logic based knowledge representation system is more than an inference engine for a particular description logic. A knowledge representation system must provide a num...
132
click to vote
DLOG
1996
1996
Description Logic as Core Machinery for the Automatic Generation of Multilingual Technical Documents
15 years 5 months ago
Our project aims at the automatic generation of multilingual text for product maintenance and documentation from a structured knowledge representation. The language independent re...
245
click to vote
POPL
2009
ACM
16 years 5 months ago
2009
ACM
Deadlock in multithreaded programs is an increasingly important problem as ubiquitous multicore architectures force parallelization upon an ever wider range of software. This pape...