1391 search results - page 56 / 279 » Completeness of Neighbourhood Logic |
AAAI
2008
13 years 11 months ago
2008
Logic programming with negation offers a compelling approach to abductive reasoning. This paper shows a simple view of abduction in this context for the completion semantics, unde...
JFPLC
1998
13 years 10 months ago
1998
Abstract. This paper presents a feature constraint system that, compared with the well-known systems OSF 1] and CFT 5], incorporates several interesting characteristics. The new sy...
CSL
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
IGPL
2002
13 years 8 months ago
2002
This paper generalises and complements the work on combining temporal logics started by Finger and Gabbay [11, 10]. We present proofs of transference of soundness, completeness an...
PPDP
2010
Springer
13 years 7 months ago
2010
Springer
Transaction Logic is a logic for representing declarative and procedural knowledge in logic programming, databases, and AI. It has been successful in areas as diverse as workflows...