517 search results - page 6 / 104 » Using dynamic logic programming to model legal reasoning |
LPNMR
2004
Springer
14 years 1 months ago
2004
Springer
Over recent years, various semantics have been proposed for dealing with updates in the setting of logic programs. The availability of different semantics naturally raises the que...
CL
2000
Springer
13 years 7 months ago
2000
Springer
Recent logic programming languages employ dynamic scheduling of calls to improve e ciency of programs. Dynamic scheduling is realized by allowing some calls to be dynamically &quo...
PPDP
1999
Springer
14 years 2 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...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Open Answer Set Programming (OASP) is an attractive framework for integrating ontologies and rules. In general OASP is undecidable. In previous work we provided a tableau-based alg...
LPNMR
1993
Springer
13 years 12 months ago
1993
Springer
The notion of assumption-based framework generalises and re nes the use of abduction to give a formalisation of non-monotonic reasoning. In this framework, a sentence is a non-mon...