3535 search results - page 29 / 707 » Logic Program Specialisation |
125
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Termination is an important and well-studied property for logic programs. However, almost all approaches for automated termination analysis focus on definite logic programs, where...
106
click to vote
RIA
2008
15 years 1 months ago
2008
Situations, the semantic interpretations of context, provide a better basis for selecting adaptive behaviours than context itself. The definition of situations typically rests on t...
CORR
2010
Springer
15 years 15 days ago
2010
Springer
Term rewriting has a significant presence in various areas, not least in automated theorem proving where it is used as a proof technique. Many theorem provers employ specialised p...
140
click to vote
LPNMR
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and checkâ...
151
click to vote
ECSQARU
2005
Springer
15 years 8 months ago
2005
Springer
Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating as well t...