3738 search results - page 109 / 748 » Parametrized Logic Programming |
SPAA
2010
ACM
14 years 27 days ago
2010
ACM
Transactional memory (TM) has shown potential to simplify the task of writing concurrent programs. Inspired by classical work on databases, formal definitions of the semantics of...
PRICAI
2000
Springer
13 years 11 months ago
2000
Springer
Defeasible logic is a simple but efficient rule-based non-monotonic logic. It has powerful implementations and shows promise to be applied in the areas of legal reasoning and the m...
PPDP
1999
Springer
14 years 9 days ago
1999
Springer
We present a slicing approach for analyzing logic programs with respect to non-termination. The notion of a failure-slice is presented which is an executable reduced fragment of th...
ICLP
1998
Springer
14 years 8 days ago
1998
Springer
The eld of theory update has seen some improvement, in what regards updating, by allowing desired updates to be speci ed by update programs. The updating of models is governed by ...
ICLP
2009
Springer
14 years 8 months ago
2009
Springer
