(Enter summary)
Abstract: . We suggest that some symmetries in logic programs be taken
into account when implementing semantics in logic programming. This may
simplify the related computation procedure, and enhance the declarative or
expressive power of the semantics.
In this paper we focus on the derivation of negative information and some
other semantic issues. First, we dene a symmetric group induced by a given
logic program, and make clear its structure and properties. Since usually
the canonical models used ... (Update)
Active bibliography (related documents): More All
1.5: Symmetric Structures in Logic Programming - Wu (1999)
(Correct)
0.6: Disjunctive Logic Programming: A Survey And Assessment - Minker, Seipel
(Correct)
0.3: Logic Programming and Knowledge Representation - Baral, Gelfond (1994)
(Correct)
Similar documents based on text: More All
0.1: Specifying Agent Interaction Protocols with UML Activity Diagrams - Lind (2000)
(Correct)
0.1: Transportation Scheduling and Simulation in a Railroad Scenario: .. - Lind, al. (1998)
(Correct)
0.1: A Process Model for the Design of Multi-Agent Systems - Lind (1999)
(Correct)
BibTeX entry: (Update)
@misc{ wu-symmetries,
author = "Jinzhao Wu",
title = "Symmetries in Logic Programs",
url = "citeseer.ist.psu.edu/252538.html" }
Citations (may not include all citations):
759
Negation as failure (context) - Clark - 1987
435
Towards a Theory of Declarative Knowledge (context) - Apt, Blair et al. - 1988
309
Symbolic Logic and Mechanical Theorem Proving (context) - Chang, Lee - 1973
295
On Closed World Data Bases (context) - Reiter - 1987
248
The Semantics of Predicate Logic as a Programming Language (context) - Van Emden, Kowalski - 1976
204
the Declarative Semantics of Deductive Data- bases and Logic.. (context) - Przymusinski - 1988
186
Negation in Logic programming (context) - Kunen - 1987
180
Logic Programming and Negation: A Survey
- Apt, Bol - 1994
159
Predicate Logic as a Programming Language (context) - Kowalski - 1974
67
Negation as Failure Using Tight Derivations for General Logi.. (context) - Van Gelder - 1988
61
Equivalences of Logic Programs (context) - Maher - 1988
41
An Introduction to the Theory of Groups (context) - Rotman - 1994
35
Non-Monotonic Reasoning - Formalization of Commonsense Reaso.. (context) - Lukaszewicz - 1990
30
Closures and Fairness in the Semantics of Programming Logics (context) - Lassez, Maher - 1984
29
A Completeness Theorem for SLDNF resolution (context) - Cavedon, Lloyd - 1989
24
Negation as Failure: Careful Closure of Procedure (context) - Gelfond, Przymusinska - 1986
24
Nonmonotonic Reasoning and the Closed World Assumption (context) - Bossu, Siegel - 1985
20
A Basis for Deductive Databases Systems II (context) - Lloyd, Toper - 1986
18
Perfect Model Semantics for Logic Programs with Equality (context) - Bachmair, Ganzinger - 1991
18
On Indenite Databases and the Closed World Assumption (context) - Minker - 1987
18
Generalized Well-Founded Semantics for Logic Programs
- Baral, Lobo et al. - 1990
15
Observational Equivalences for Logic Programs
- Gabbrielli, Levi et al. - 1992
5
the Consistency of First Order Logic Programs (context) - Sato - 1987
2
Answering Queries in Indenite Databases and the Null Value P.. (context) - Grant, Minker - 1986
2
Completion and Stratication (context) - Shepherdson - 1998
2
Berlin Heidelberg New York London Paris Tokyo (context) - Lloyd - 1987
1
Compiling the GCWA in Indenite Deductive Data -bases (context) - Henschen, Park - 1988
1
Symmetric Structures in Logic Programming
- Wu - 1999
Documents on the same site (http://www.mpi-sb.mpg.de/~wu/papers/publications.html): More
On Theorem Proving in Annotated Logics - Mi Lu, Jinzhao Wu
(Correct)
First-Order Polynomial Based Theorem Proving - Wu (1999)
(Correct)
CWA extensions to Multi-Valued Logics - Wu
(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