275 search results - page 38 / 55 » Non-Termination Inference of Logic Programs |
ICFP
2002
ACM
15 years 9 months ago
2002
ACM
We propose an extension of Haskell's type class system with bstractions in the type language. Type inference for our extension relies on a novel constrained unification proce...
FM
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. Program certification techniques formally show that programs satisfy certain safety policies. They rely on the correctness of the safety policy which has to be establish...
POPL
2010
ACM
15 years 7 months ago
2010
ACM
The automated inference of quantified invariants is considered one of the next challenges in software verification. The question of the right precision-efficiency tradeoff for the...
ICMLA
2007
14 years 11 months ago
2007
In our research we study rational agents which learn how to choose the best conditional, partial plan in any situation. The agent uses an incomplete symbolic inference engine, emp...
112
click to vote
SP
2000
IEEE
15 years 2 months ago
2000
IEEE
We address the goal of making Delegation Logic (DL) into a practically implementable and tractable trustmanagement system. DL [22] is a logic-based knowledge representation (i.e.,...