1313 search results - page 158 / 263 » Prioritized Reasoning in Logic Programming |
LPNMR
2005
Springer
15 years 3 months ago
2005
Springer
Given two classes of logic programs, we may be interested in modular translations from one class into the other that are sound wth respect to the answer set semantics. The main the...
CORR
2010
Springer
14 years 7 months ago
2010
Springer
The paper presents a simple and concise proof of correctness of the magic transformation. We believe it may provide a useful example of formal reasoning about logic programs. The ...
PPDP
2009
Springer
15 years 4 months ago
2009
Springer
We propose a novel type inference algorithm for a dependentlytyped functional language. The novel features of our algorithm are: (i) it can iteratively refine dependent types wit...
105
click to vote
IPPS
2000
IEEE
15 years 2 months ago
2000
IEEE
Abstract. Knowledge discovery is a time-consuming and space intensive endeavor. By distributing such an endeavor, we can diminish both time and space. System INDED pronounced indee...
LATA
2009
Springer
15 years 4 months ago
2009
Springer
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...