François Bry  Home/Search
Context Related
| pms.informatik.uni...MSFB20016.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: pms.informatik.unimuench...index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The model theory of a rst-order logic called N 4 is introduced. N 4 does not eliminate double negations, as classical logic does, but instead reduces fourfold negations. N 4 is very close to classical logic: N 4 has two truth values; implications are, in N 4 like in classical logic, material; and negation distributes over compound formulas in N 4 as it does in classical logic. Results suggest that the semantics of normal logic programs is conveniently formalized in N 4 :... (Update)
Similar documents based on text: More All
0.8: Symmetry in XPath - Olteanu, Meuss, Furche, Bry (2001) (Correct)
0.6: Web Services for Teaching: A Case Study - Bry, Eisinger, Schneemayer (2003) (Correct)
0.4: Query Answering in Information Systems with Integrity Constraints - Bry (1997) (Correct)
BibTeX entry: (Update)
Bry, F.: An Almost Classical Logic for Logic Programming and Nonmonotonic Reasoning. In: Proc. Paraconsistent Computational Logic. (2002) http://citeseer.ist.psu.edu/bry01almost.html More
@misc{ bry02almost,
author = "F. Bry",
title = "An Almost Classical Logic for Logic Programming and Nonmonotonic Reasoning",
text = "Bry, F.: An Almost Classical Logic for Logic Programming and Nonmonotonic
Reasoning. In: Proc. Paraconsistent Computational Logic. (2002)",
year = "2002",
url = "citeseer.ist.psu.edu/bry01almost.html" }
Citations (may not include all citations):858 The Stable Model Semantics For Logic Programming - Gelfond, Lifschitz - 1988
180 Logic Programming And Negation: A Survey - Apt, Bol - 1994
82 Semantics of Logic Programs: Their Intuitions and Formal Pro.. - Dix - 1995
26 Negation in Rule-Based Database languages: A Survey (context) - Bidoit - 1991
17 A Fixpoint Characterization of Abductive Logic Programming - Inoue, Sakama - 1996
14 Strict Completion of Logic Programs (context) - Drabent, Martelli - 1991
11 A Classication-Theory of Semantics of Normal Logic Programs (context) - Dix - 1995
11 A Classication-Theory of Semantics of Normal Logic Programs:.. (context) - Dix - 1995
11 and Computable Completions for Unrestricted Logic Programs (context) - Wallace, Consistent - 1993
11 A Tableau Calculus For Minimal Model Reasoning (context) - Niemel - 1996
8 Nonmonotonic Reasoning: Towards Ecient Calculi and Implement.. (context) - Dix, Furbach et al. - 2001
Documents on the same site (http://www.pms.informatik.uni-muenchen.de/publikationen/index.html): More
A Deduction Method Complete for Refutation and Finite.. - Bry, Torge (1998) (Correct)
A Confluence Test for Concurrent Constraint Programs - Abdennadher, Frühwirth.. (1995) (Correct)
Problem Solving with Model-Generation Approaches based on.. - Eisinger, Geisler (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC