4513 search results - page 35 / 903 » Logic programming with satisfiability |
ICALP
2007
Springer
15 years 4 months ago
2007
Springer
In this paper we present the theory and practice of co-logic programming (co-LP for brevity), a paradigm that combines both inductive and coinductive logic programming. Co-LP is a ...
VLSID
2002
IEEE
15 years 10 months ago
2002
IEEE
In preemptive real-time systems, a tighter estimate of the Worst Case Response Time(WCRT) of the tasks can be obtained if the layout of the tasks in memory is included in the esti...
ISSTA
1989
ACM
15 years 2 months ago
1989
ACM
The all-du-paths software testing criterion is the most discriminating of the data ow testing criteria of Rapps and Weyuker. Unfortunately, in the worst case, the criterion requir...
AI
2008
Springer
14 years 10 months ago
2008
Springer
Representing and reasoning about time dependent information is a key research issue in many areas of computer science and artificial intelligence. One of the best known and widely...
CORR
1999
Springer
14 years 9 months ago
1999
Springer
A variational approach to finite connectivity spin-glass-like models is developed and applied to describe the structure of optimal solutions in random satisfiability problems. Our ...