Logic programming and knowledge representation—The A-Prolog perspective

In this paper we give a short introduction to logic programming approach to knowledge representation and reasoning. The intention is to help the reader to develop a ‘feel’ for the field's history and some of its recent developments. The discussion is mainly limited to logic programs under the a...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Artificial intelligence Ročník 138; číslo 1; s. 3 - 38
Hlavní autori: Gelfond, Michael, Leone, Nicola
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier B.V 01.06.2002
Predmet:
ISSN:0004-3702, 1872-7921
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract In this paper we give a short introduction to logic programming approach to knowledge representation and reasoning. The intention is to help the reader to develop a ‘feel’ for the field's history and some of its recent developments. The discussion is mainly limited to logic programs under the answer set semantics. For understanding of approaches to logic programming built on well-founded semantics, general theories of argumentation, abductive reasoning, etc., the reader is referred to other publications.
AbstractList Article included in a special issue devoted to the theme: Knowledge presentation and logic programming. Presents a short introduction to the logic programming approach to knowledge representation and reasoning. The intention is to help the reader to develop a 'feel' for the field's history and some of its recent developments. The discussion is mainly limited to logic programs under the answer set semantics. For understanding of approaches to logic programming built on well-founded semantics, general theories of argumentation, abductive reasoning, the reader is referred to other publications. (Original abstract)
In this paper we give a short introduction to logic programming approach to knowledge representation and reasoning. The intention is to help the reader to develop a ‘feel’ for the field's history and some of its recent developments. The discussion is mainly limited to logic programs under the answer set semantics. For understanding of approaches to logic programming built on well-founded semantics, general theories of argumentation, abductive reasoning, etc., the reader is referred to other publications.
Author Leone, Nicola
Gelfond, Michael
Author_xml – sequence: 1
  givenname: Michael
  surname: Gelfond
  fullname: Gelfond, Michael
  email: mgelfond@cs.ttu.edu
  organization: Department of Computer Science, Texas Tech University, Lubbock, TX 79409-3104, USA
– sequence: 2
  givenname: Nicola
  surname: Leone
  fullname: Leone, Nicola
  email: leone@unical.it
  organization: Department of Mathematics, University of Calabria, 87030 Rende (CS), Italy
BookMark eNqFkMFq3DAQhkXZQHeTPELAp5AenIwk27LooYSQNIGFBpKchSyNXTVeyZG8G3rLQ_QJ-yTxZksPuQQGhoH_G2a-BZn54JGQIwqnFGh1dgcARc4FsBNgXwAYiJx9InNaC5YLyeiMzP9HPpNFSr-mkUtJ5-RmGTpnsiGGLurVyvku095mjz4892g7zCIOERP6UY8u-L8vf-5_Ynae38bQhy4bMKYBzeg2eED2Wt0nPPzX98nD1eX9xXW-_PH95uJ8mRvO6zGvW6Elb4pK14UsBdgKaNOWjaVCNlDS2mLRlLqSjIMtahANM7KUFFoprGQV3yfHu73TzU9rTKNauWSw77XHsE6qFCWVHPgULHdBE0NKEVs1RLfS8beioLbi1Js4tbWitrUVp9jEfX3HGbf7foza9R_S33Y0Tg42DqNKxqE3aF2cRCkb3AcbXgFxSom3
CitedBy_id crossref_primary_10_1016_j_artint_2018_11_002
crossref_primary_10_1017_S1471068422000047
crossref_primary_10_1007_s10472_011_9226_1
crossref_primary_10_1016_j_jalgor_2008_02_003
crossref_primary_10_1017_S1471068413000410
crossref_primary_10_1093_logcom_exaa005
crossref_primary_10_3166_jancl_16_35_86
crossref_primary_10_1007_s10472_011_9237_y
crossref_primary_10_1017_S1471068413000094
crossref_primary_10_1109_TKDE_2012_86
crossref_primary_10_1016_j_ins_2022_01_076
crossref_primary_10_1016_j_artint_2015_10_005
crossref_primary_10_1109_TCIAIG_2015_2509600
crossref_primary_10_1007_s10115_015_0890_z
crossref_primary_10_1017_S1471068409990056
crossref_primary_10_1007_s10601_008_9055_y
crossref_primary_10_1017_S1471068408003578
crossref_primary_10_1016_j_artint_2009_11_016
crossref_primary_10_1016_j_artint_2020_103344
crossref_primary_10_1007_s10472_005_7030_5
crossref_primary_10_1109_TKDE_2010_84
crossref_primary_10_1093_logcom_exaf038
crossref_primary_10_1016_j_ijar_2019_05_003
crossref_primary_10_1016_j_artint_2010_08_004
crossref_primary_10_1007_s13218_016_0480_6
crossref_primary_10_1093_logcom_exab082
crossref_primary_10_1017_S147106841100007X
crossref_primary_10_3233_IA_170104
crossref_primary_10_1016_j_datak_2010_01_005
crossref_primary_10_1017_S1471068407003031
crossref_primary_10_1609_aimag_v29i4_2179
crossref_primary_10_1017_S147106840700302X
crossref_primary_10_1016_j_artint_2015_09_008
crossref_primary_10_1017_S1471068416000399
crossref_primary_10_1016_j_ijar_2017_06_002
crossref_primary_10_1017_S1471068411000652
crossref_primary_10_1017_S147106840800358X
crossref_primary_10_1007_s00153_022_00821_x
crossref_primary_10_1017_S1471068408003633
crossref_primary_10_1093_logcom_ext068
crossref_primary_10_1017_S1471068409990159
crossref_primary_10_1016_j_cl_2009_09_001
crossref_primary_10_1093_logcom_exv089
crossref_primary_10_1145_1183278_1183279
crossref_primary_10_1016_j_ijar_2017_07_005
crossref_primary_10_1007_s10472_008_9098_1
crossref_primary_10_1145_1055686_1055694
crossref_primary_10_1016_j_artint_2012_04_001
crossref_primary_10_1017_S1471068419000449
Cites_doi 10.1007/BF01536399
10.1016/0004-3702(80)90011-9
10.1016/0743-1066(95)00118-2
10.1145/177492.177673
10.1016/S0004-3702(97)00015-5
10.1109/69.599933
10.1006/inco.1997.2630
10.1016/S0004-3702(02)00187-X
10.1016/0004-3702(94)00035-Y
10.1016/0743-1066(90)90032-Z
10.1016/0743-1066(87)90007-0
10.1016/S0743-1066(14)80003-4
10.1145/321978.321991
10.1093/logcom/1.6.835
10.1016/0743-1066(94)90025-6
10.2307/2273858
10.1016/S0004-3702(02)00183-2
10.1016/S0022-0000(05)80053-4
10.1016/0743-1066(92)90019-Y
10.1016/0743-1066(94)00028-5
10.1016/0890-5401(91)90073-B
10.1016/0004-3702(85)90042-6
10.1145/322290.322293
10.1016/S0743-1066(96)00125-2
10.1023/A:1018930122475
10.1016/S0743-1066(97)00073-3
10.1016/S0004-3702(02)00182-0
10.1007/BF01530761
10.1016/S0304-3975(97)00129-1
10.1016/0004-3702(80)90014-4
10.1016/B978-1-4832-1446-7.50018-2
10.1016/S0004-3702(02)00185-6
10.1016/S0004-3702(02)00186-8
10.1016/S0004-3702(00)00054-0
10.1145/261124.261126
10.2307/2268973
10.1145/116825.116838
10.1016/0743-1066(94)90024-8
10.1016/0743-1066(89)90022-8
10.1016/S0743-1066(85)80005-4
10.1016/0743-1066(93)90035-F
10.1016/0004-3702(80)90012-0
10.1017/S1471068401001144
10.1016/0004-3702(86)90032-9
10.1016/0004-3702(90)90086-F
10.1016/S0004-3702(97)00058-1
10.1016/0004-3702(85)90055-4
10.1007/BF03037169
10.1016/S0004-3702(02)00184-4
10.1007/BF01530759
ContentType Journal Article
Copyright 2002 Elsevier Science B.V.
Copyright_xml – notice: 2002 Elsevier Science B.V.
DBID 6I.
AAFTH
AAYXX
CITATION
E3H
F2A
DOI 10.1016/S0004-3702(02)00207-2
DatabaseName ScienceDirect Open Access Titles
Elsevier:ScienceDirect:Open Access
CrossRef
Library & Information Sciences Abstracts (LISA)
Library & Information Science Abstracts (LISA)
DatabaseTitle CrossRef
Library and Information Science Abstracts (LISA)
DatabaseTitleList Library and Information Science Abstracts (LISA)

DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1872-7921
EndPage 38
ExternalDocumentID 10_1016_S0004_3702_02_00207_2
S0004370202002072
GroupedDBID --K
--M
--Z
-~X
.DC
.~1
0R~
1B1
1~.
1~5
23N
4.4
457
4G.
5GY
5VS
6I.
6J9
6TJ
7-5
71M
77K
8P~
9JN
AACTN
AAEDT
AAEDW
AAFTH
AAIAV
AAIKJ
AAKOC
AAKPC
AALRI
AAOAW
AAQFI
AAQXK
AAXUO
AAYFN
ABBOA
ABFNM
ABFRF
ABJNI
ABMAC
ABVKL
ABXDB
ABYKQ
ACDAQ
ACGFO
ACGFS
ACNCT
ACNNM
ACRLP
ACWUS
ACZNC
ADBBV
ADEZE
ADMUD
AEBSH
AECPX
AEFWE
AEKER
AENEX
AETEA
AEXQZ
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AHJVU
AHZHX
AIALX
AIEXJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOUOD
ASPBG
AVWKF
AXJTR
AZFZN
BJAXD
BKOJK
BLXMC
CS3
E3Z
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
F0J
F5P
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-2
G-Q
G8K
GBLVA
GBOLZ
HLZ
HVGLF
HZ~
IHE
IXB
J1W
JJJVA
KOM
KQ8
LG9
LY7
M41
MO0
MVM
N9A
NCXOZ
O-L
O9-
OAUVE
OK1
OZT
P-8
P-9
P2P
PC.
PQQKQ
Q38
R2-
RIG
RNS
ROL
RPZ
SBC
SDF
SDG
SDP
SES
SET
SEW
SPC
SPCBC
SST
SSV
SSZ
T5K
TAE
TN5
TR2
TWZ
UPT
UQL
VQA
WH7
WUQ
XFK
XJE
XJT
XPP
XSW
ZMT
~02
~G-
77I
9DU
AATTM
AAXKI
AAYWO
AAYXX
ABDPE
ABWVN
ACLOT
ACRPL
ACVFH
ADCNI
ADNMO
ADVLN
AEIPS
AEUPX
AFJKZ
AFPUW
AGQPQ
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
CITATION
EFKBS
~HD
E3H
F2A
ID FETCH-LOGICAL-c338t-8f7a93b46a849570d601bf5bd179b0518de4b5a69230d4807b2c95910f97d9263
ISICitedReferencesCount 100
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000176430000002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0004-3702
IngestDate Sun Sep 28 13:16:59 EDT 2025
Sat Nov 29 05:28:54 EST 2025
Tue Nov 18 21:39:52 EST 2025
Fri Feb 23 02:27:15 EST 2024
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 1
Keywords Default reasoning
Logic programming
Nonmonotonic reasoning
Answer set programming
Language English
License http://www.elsevier.com/open-access/userlicense/1.0
https://www.elsevier.com/tdm/userlicense/1.0
https://www.elsevier.com/open-access/userlicense/1.0
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c338t-8f7a93b46a849570d601bf5bd179b0518de4b5a69230d4807b2c95910f97d9263
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
OpenAccessLink https://dx.doi.org/10.1016/S0004-3702(02)00207-2
PQID 57519303
PQPubID 23477
PageCount 36
ParticipantIDs proquest_miscellaneous_57519303
crossref_primary_10_1016_S0004_3702_02_00207_2
crossref_citationtrail_10_1016_S0004_3702_02_00207_2
elsevier_sciencedirect_doi_10_1016_S0004_3702_02_00207_2
PublicationCentury 2000
PublicationDate 2002-06-01
PublicationDateYYYYMMDD 2002-06-01
PublicationDate_xml – month: 06
  year: 2002
  text: 2002-06-01
  day: 01
PublicationDecade 2000
PublicationTitle Artificial intelligence
PublicationYear 2002
Publisher Elsevier B.V
Publisher_xml – name: Elsevier B.V
References B. Cui, T. Swift, Preference Logic grammars: Semantics, standardization, and application to data standardization, Artificial Intelligence 138 (2002) 117–147, this issue
Eiter, Gottlob, Mannila (BIB029) 1997; 22
Eiter, Leone, Saccá (BIB036) 1998; 206
Chen, Swift, Warren (BIB021) 1995; 24
Lifschitz (BIB073) 1994
Gabbay (BIB046) 1985
Lifschitz (BIB069) 1990
You, Yuan (BIB127) 1994; 49
Faber, Leone, Pfeifer (BIB042) 2001
Kowalski (BIB062) 1979
Kunen (BIB063) 1987; 4
Marek, Subrahmanian (BIB077) 1989
McCarthy, Hayes (BIB084) 1969
Stroetman (BIB120) 1993; 15
Stockmeyer (BIB119) 1987; 52
Wagner (BIB126) 1991; 1
Minker (BIB090) 1982
Sato (BIB114) 1990; 9
Sakama, Inoue (BIB115) 2000; 123
Lifschitz, Schwarz (BIB070) 1993
Marek, Truszczyński (BIB080) 1993
Chen (BIB020) 1993
Gottlob (BIB053) 1994
McCarthy (BIB083) 1959
J.J. Alferes, L.M. Pereira, H. Przymusinska, T.C. Przymusinski, LUPS—A language for updating logic programs, Artificial Intelligence 138 (2002) 87–116, this issue
East, Truszczyński (BIB033) 2000
Przymusinski (BIB107) 1988
Gelfond, Son (BIB052) 1998; 1471
Minker (BIB092) 1999
Babovich, Erdem, Lifschitz (BIB014) 2000
Elkan (BIB037) 1990; 43
Nerode, Shore (BIB097) 1997
Egly, Eiter, Tompits, Woltran (BIB034) 2000
Eiter, Gottlob (BIB035) 1995; 15
Papadimitriou (BIB103) 1994
Baral (BIB008)
Bol, Degerstedt (BIB015) 1998; 34
McCain, Turner (BIB087) 1998
McCarthy (BIB085) 1980; 13
Kaminski (BIB059) 1995; 77
Moore (BIB095) 1985; 25
Koch, Leone (BIB060) 1999
Erdem, Lifschitz, Wong (BIB039) 2000
V. Marek, I. Pivkina, M. Truszczyński, Annotated revision programs, Artificial Intelligence 138 (2002) 149–180, this issue
Gelfond, Lifschitz (BIB050) 1991
Minker (BIB091) 1994; 12
Ross (BIB113) 1992; 13
Apt, Bol (BIB007) 1994; 19–20
De Schreye, Bruynooghe, Demoen, Denecker, Janssens, Martens (BIB024) 2000; 13
Przymusinski (BIB108) 1989
G. Gottlob, F. Scarcello, M. Sideri, Fixed-parameter complexity in AI and nonmonotonic reasoning, Artificial Intelligence 130 (2002) 55–86, this issue
McDermott (BIB088) 1982; 29
Kowalski (BIB061) 1974
Hayes (BIB056) 1973
M. Minsky, A framework for representing knowledge, in: P. Winston (Ed.), The Psychology of Computer Vision, McGraw-Hill, New York, pp. 211–277
Lifschitz (BIB067) 1985; 27
Baral, Gelfond (BIB010) 2000
A. Colmerauer, H. Kanoui, R. Pasero, P. Roussel, Un systeme de communication homme-machine en Francais, Technical Report, Groupe de Intelligence Artificielle Université de Aix-Marseilles II, Marseilles, 1973
Leone, Rullo, Scarcello (BIB066) 1997; 135
Apt, Pellegrini (BIB006) 1994; 16
Gelfond, Lifschitz (BIB049) 1988
Pearce (BIB106) 1999
Dimopoulos, Nebel, Koehler (BIB032) 1997; 1348
McCarthy (BIB086) 1986; 26
Reiter (BIB111) 1980; 13
Niemelä (BIB098) 1999; 25
Fages (BIB043) 1994; 1
Clark (BIB030) 1978
Van Gelder, Ross, Schlipf (BIB125) 1991; 38
P. Simons, I. Niemelä, T. Soininen, Extending and implementing the stable model semantics, Artificial Intelligence 138 (2002) 181–234, this issue
Fitting (BIB044) 1985; 2
Kaminski (BIB058) 1997; 96
Gelfond (BIB048) 1987
Apt, Blair, Walker (BIB004) 1988
Reiter (BIB110) 1978
McDermott, Doyle (BIB089) 1980; 13
Turner (BIB122) 1997; 31
Apt (BIB003) 1997
Drabent (BIB026) 1996; 27
Eiter, Leone, Mateis, Pfeifer, Scarcello (BIB027) 1997; 1265
Green (BIB055) 1969
Bidoit, Froidevaux (BIB012) 1991; 91
Lehmann (BIB065) 1989
Lifschitz (BIB068) 1988
Lobo, Minker, Rajasekar (BIB074) 1992
Franconi, Laureti Palma, Leone, Perri, Scarcello (BIB045) 2001
Bondarenko, Dung, Kowalski, Toni (BIB016) 1997; 93
M. Gelfond, V. Lifschitz, Representing actions and change by logic programs, J. Logic Programming 17, 301–323
Giordano, Martelli (BIB047) 1990
Cholewinski, Marek, Truszczyński (BIB022) 1996
Soininen, Niemelä (BIB100) 1999; 1551
Brewka, Dix, Konolige (BIB017) 1997
Kakas, Kowalski, Toni (BIB057) 1998
Przymusinska, Przymusinski (BIB109) 1988
Bidoit, Froidevaux (BIB013) 1991; 79
Reiter (BIB112) 1982
Lifschitz (BIB071) 1996
Esghi (BIB038) 1990
Tamaki, Sato (BIB121) 1984
F. Calimeri, W. Faber, N. Leone, G. Pfeifer, Pruning operators for answer set programming systems, DBAI-TR-01-10, Institut für Informationssysteme, Technische Universität Wien, Austria, April, 2001
Nogueira, Balduccini, Gelfond, Watson, Barry (BIB102) 2001; 1990
Nilsson, Maluszynski (BIB101)
Faber, Leone, Pfeifer (BIB041) 1999; 1730
Turner (BIB123) 2001; 1
Apt, Pedreschi (BIB005) 1991; 526
Marek, Truszczyński (BIB078) 1989
Baral, Gelfond (BIB009) 1994; 19,20
Marek, Truszczyński (BIB081) 1999
van Emden, Kowalski (BIB124) 1976; 23
(BIB093) 2000
Faber, Leone, Mateis, Pfeifer (BIB040) 1999
V. Lifschitz, Answer set programming and plan generation, Artificial Intelligence 138 (2002) 39–54, this issue
Shanahan (BIB116) 1997
Ben-Eliyahu, Dechter (BIB011) 1994; 12
Alferes, Pereira (BIB001) 1996
Makinson (BIB075) 1993
Niemelä, Simons (BIB099) 1997
Marek, Truszczyński (BIB079) 1991; 3
Pearce (BIB105) 1997; 1216
Schwarz (BIB117) 1991
Kunen (BIB064) 1989; 7
Marek, Truszczyński (BIB082) 1993
Dix (BIB025) 1991
Nelson (BIB096) 1949; 14
Eiter, Faber, Leone, Pfeifer (BIB028) 2000
D. Pearce, G. Wagner, Reasoning with negative information 1—Strong negation in logic programming, Technical Report, Gruppe fur Logic, Wissentheorie and Information, Freie Universität Berlin, 1989
M. Cadoli, T. Eiter, G. Gottlob, Default logic as a query language, IEEE Trans. Knowledge Data Engrg. 9 (3) 448–463
Dix (10.1016/S0004-3702(02)00207-2_BIB025) 1991
Lifschitz (10.1016/S0004-3702(02)00207-2_BIB070) 1993
Apt (10.1016/S0004-3702(02)00207-2_BIB006) 1994; 16
Brewka (10.1016/S0004-3702(02)00207-2_BIB017) 1997
Reiter (10.1016/S0004-3702(02)00207-2_BIB112) 1982
Eiter (10.1016/S0004-3702(02)00207-2_BIB036) 1998; 206
Marek (10.1016/S0004-3702(02)00207-2_BIB079) 1991; 3
Shanahan (10.1016/S0004-3702(02)00207-2_BIB116) 1997
Przymusinska (10.1016/S0004-3702(02)00207-2_BIB109) 1988
10.1016/S0004-3702(02)00207-2_BIB031
Kakas (10.1016/S0004-3702(02)00207-2_BIB057) 1998
Green (10.1016/S0004-3702(02)00207-2_BIB055) 1969
Bondarenko (10.1016/S0004-3702(02)00207-2_BIB016) 1997; 93
Lobo (10.1016/S0004-3702(02)00207-2_BIB074) 1992
Kowalski (10.1016/S0004-3702(02)00207-2_BIB061) 1974
McCarthy (10.1016/S0004-3702(02)00207-2_BIB083) 1959
Baral (10.1016/S0004-3702(02)00207-2_BIB009) 1994; 19,20
Alferes (10.1016/S0004-3702(02)00207-2_BIB001) 1996
Chen (10.1016/S0004-3702(02)00207-2_BIB020) 1993
Babovich (10.1016/S0004-3702(02)00207-2_BIB014) 2000
Franconi (10.1016/S0004-3702(02)00207-2_BIB045) 2001
McDermott (10.1016/S0004-3702(02)00207-2_BIB089) 1980; 13
Egly (10.1016/S0004-3702(02)00207-2_BIB034) 2000
Kaminski (10.1016/S0004-3702(02)00207-2_BIB059) 1995; 77
Pearce (10.1016/S0004-3702(02)00207-2_BIB105) 1997; 1216
Turner (10.1016/S0004-3702(02)00207-2_BIB123) 2001; 1
Sato (10.1016/S0004-3702(02)00207-2_BIB114) 1990; 9
East (10.1016/S0004-3702(02)00207-2_BIB033) 2000
Nilsson (10.1016/S0004-3702(02)00207-2_BIB101)
Pearce (10.1016/S0004-3702(02)00207-2_BIB106) 1999
Eiter (10.1016/S0004-3702(02)00207-2_BIB029) 1997; 22
Faber (10.1016/S0004-3702(02)00207-2_BIB040) 1999
Lifschitz (10.1016/S0004-3702(02)00207-2_BIB073) 1994
Niemelä (10.1016/S0004-3702(02)00207-2_BIB098) 1999; 25
Makinson (10.1016/S0004-3702(02)00207-2_BIB075) 1993
Erdem (10.1016/S0004-3702(02)00207-2_BIB039) 2000
McDermott (10.1016/S0004-3702(02)00207-2_BIB088) 1982; 29
Marek (10.1016/S0004-3702(02)00207-2_BIB082) 1993
Baral (10.1016/S0004-3702(02)00207-2_BIB010) 2000
10.1016/S0004-3702(02)00207-2_BIB019
Esghi (10.1016/S0004-3702(02)00207-2_BIB038) 1990
10.1016/S0004-3702(02)00207-2_BIB018
Bidoit (10.1016/S0004-3702(02)00207-2_BIB013) 1991; 79
Gelfond (10.1016/S0004-3702(02)00207-2_BIB049) 1988
Lifschitz (10.1016/S0004-3702(02)00207-2_BIB069) 1990
Marek (10.1016/S0004-3702(02)00207-2_BIB078) 1989
10.1016/S0004-3702(02)00207-2_BIB094
Nogueira (10.1016/S0004-3702(02)00207-2_BIB102) 2001; 1990
Przymusinski (10.1016/S0004-3702(02)00207-2_BIB107) 1988
Lifschitz (10.1016/S0004-3702(02)00207-2_BIB067) 1985; 27
Minker (10.1016/S0004-3702(02)00207-2_BIB091) 1994; 12
Chen (10.1016/S0004-3702(02)00207-2_BIB021) 1995; 24
Gottlob (10.1016/S0004-3702(02)00207-2_BIB053) 1994
Turner (10.1016/S0004-3702(02)00207-2_BIB122) 1997; 31
Lehmann (10.1016/S0004-3702(02)00207-2_BIB065) 1989
Bol (10.1016/S0004-3702(02)00207-2_BIB015) 1998; 34
McCarthy (10.1016/S0004-3702(02)00207-2_BIB086) 1986; 26
Nerode (10.1016/S0004-3702(02)00207-2_BIB097) 1997
You (10.1016/S0004-3702(02)00207-2_BIB127) 1994; 49
Gelfond (10.1016/S0004-3702(02)00207-2_BIB048) 1987
Stockmeyer (10.1016/S0004-3702(02)00207-2_BIB119) 1987; 52
Marek (10.1016/S0004-3702(02)00207-2_BIB077) 1989
10.1016/S0004-3702(02)00207-2_BIB023
Tamaki (10.1016/S0004-3702(02)00207-2_BIB121) 1984
Gelfond (10.1016/S0004-3702(02)00207-2_BIB052) 1998; 1471
Marek (10.1016/S0004-3702(02)00207-2_BIB081) 1999
Schwarz (10.1016/S0004-3702(02)00207-2_BIB117) 1991
Eiter (10.1016/S0004-3702(02)00207-2_BIB035) 1995; 15
Faber (10.1016/S0004-3702(02)00207-2_BIB042) 2001
Papadimitriou (10.1016/S0004-3702(02)00207-2_BIB103) 1994
Ben-Eliyahu (10.1016/S0004-3702(02)00207-2_BIB011) 1994; 12
Moore (10.1016/S0004-3702(02)00207-2_BIB095) 1985; 25
Kowalski (10.1016/S0004-3702(02)00207-2_BIB062) 1979
Kunen (10.1016/S0004-3702(02)00207-2_BIB063) 1987; 4
Giordano (10.1016/S0004-3702(02)00207-2_BIB047) 1990
Eiter (10.1016/S0004-3702(02)00207-2_BIB028) 2000
Minker (10.1016/S0004-3702(02)00207-2_BIB090) 1982
10.1016/S0004-3702(02)00207-2_BIB118
Nelson (10.1016/S0004-3702(02)00207-2_BIB096) 1949; 14
Fages (10.1016/S0004-3702(02)00207-2_BIB043) 1994; 1
Drabent (10.1016/S0004-3702(02)00207-2_BIB026) 1996; 27
De Schreye (10.1016/S0004-3702(02)00207-2_BIB024) 2000; 13
10.1016/S0004-3702(02)00207-2_BIB076
McCarthy (10.1016/S0004-3702(02)00207-2_BIB084) 1969
Hayes (10.1016/S0004-3702(02)00207-2_BIB056) 1973
Apt (10.1016/S0004-3702(02)00207-2_BIB005) 1991; 526
10.1016/S0004-3702(02)00207-2_BIB072
Sakama (10.1016/S0004-3702(02)00207-2_BIB115) 2000; 123
Apt (10.1016/S0004-3702(02)00207-2_BIB003) 1997
Reiter (10.1016/S0004-3702(02)00207-2_BIB111) 1980; 13
Minker (10.1016/S0004-3702(02)00207-2_BIB092) 1999
Leone (10.1016/S0004-3702(02)00207-2_BIB066) 1997; 135
Dimopoulos (10.1016/S0004-3702(02)00207-2_BIB032) 1997; 1348
10.1016/S0004-3702(02)00207-2_BIB002
Apt (10.1016/S0004-3702(02)00207-2_BIB007) 1994; 19–20
Marek (10.1016/S0004-3702(02)00207-2_BIB080) 1993
Koch (10.1016/S0004-3702(02)00207-2_BIB060) 1999
McCarthy (10.1016/S0004-3702(02)00207-2_BIB085) 1980; 13
(10.1016/S0004-3702(02)00207-2_BIB093) 2000
Bidoit (10.1016/S0004-3702(02)00207-2_BIB012) 1991; 91
Eiter (10.1016/S0004-3702(02)00207-2_BIB027) 1997; 1265
Lifschitz (10.1016/S0004-3702(02)00207-2_BIB068) 1988
McCain (10.1016/S0004-3702(02)00207-2_BIB087) 1998
Gabbay (10.1016/S0004-3702(02)00207-2_BIB046) 1985
Reiter (10.1016/S0004-3702(02)00207-2_BIB110) 1978
Wagner (10.1016/S0004-3702(02)00207-2_BIB126) 1991; 1
Faber (10.1016/S0004-3702(02)00207-2_BIB041) 1999; 1730
Przymusinski (10.1016/S0004-3702(02)00207-2_BIB108) 1989
Apt (10.1016/S0004-3702(02)00207-2_BIB004) 1988
10.1016/S0004-3702(02)00207-2_BIB054
Van Gelder (10.1016/S0004-3702(02)00207-2_BIB125) 1991; 38
10.1016/S0004-3702(02)00207-2_BIB051
Kaminski (10.1016/S0004-3702(02)00207-2_BIB058) 1997; 96
Ross (10.1016/S0004-3702(02)00207-2_BIB113) 1992; 13
Fitting (10.1016/S0004-3702(02)00207-2_BIB044) 1985; 2
Cholewinski (10.1016/S0004-3702(02)00207-2_BIB022) 1996
Baral (10.1016/S0004-3702(02)00207-2_BIB008)
Clark (10.1016/S0004-3702(02)00207-2_BIB030) 1978
Lifschitz (10.1016/S0004-3702(02)00207-2_BIB071) 1996
Stroetman (10.1016/S0004-3702(02)00207-2_BIB120) 1993; 15
Kunen (10.1016/S0004-3702(02)00207-2_BIB064) 1989; 7
Gelfond (10.1016/S0004-3702(02)00207-2_BIB050) 1991
Niemelä (10.1016/S0004-3702(02)00207-2_BIB099) 1997
10.1016/S0004-3702(02)00207-2_BIB104
Soininen (10.1016/S0004-3702(02)00207-2_BIB100) 1999; 1551
van Emden (10.1016/S0004-3702(02)00207-2_BIB124) 1976; 23
Elkan (10.1016/S0004-3702(02)00207-2_BIB037) 1990; 43
References_xml – start-page: 212
  year: 1998
  end-page: 223
  ident: BIB087
  article-title: Satisfiability planning with causal theories
  publication-title: Proc. Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR-98), Trento, Italy
– start-page: 70
  year: 1999
  end-page: 75
  ident: BIB060
  article-title: Stable model checking made easy
  publication-title: Proc. IJCAI-99, Stockholm, Sweden
– volume: 1990
  start-page: 169
  year: 2001
  end-page: 183
  ident: BIB102
  article-title: A-Prolog decision support system for the Space Shuttle
  publication-title: Proc. Third International Symposium on Practical Aspects of Declarative Languages
– reference: F. Calimeri, W. Faber, N. Leone, G. Pfeifer, Pruning operators for answer set programming systems, DBAI-TR-01-10, Institut für Informationssysteme, Technische Universität Wien, Austria, April, 2001
– start-page: 260
  year: 1991
  end-page: 274
  ident: BIB117
  article-title: Autoepistemic logic of knowledge
  publication-title: Logic Programming and Nonmonotonic Reasoning: Proc. First Internat. Workshop
– start-page: 193
  year: 1988
  end-page: 216
  ident: BIB107
  article-title: On the declarative semantics of deductive databases and logic programs
  publication-title: Foundations of Deductive Databases and Logic Programming
– volume: 1348
  start-page: 169
  year: 1997
  end-page: 181
  ident: BIB032
  article-title: Encoding planning problems in nonmonotonic logic programs
  publication-title: Recent Advances in AI Planning, Proc. 4th European Conference on Planning, ECP-97
– volume: 9
  start-page: 33
  year: 1990
  end-page: 44
  ident: BIB114
  article-title: Completed logic programs and their consistency
  publication-title: J. Logic Programming
– year: 1993
  ident: BIB082
  publication-title: Nonmonotonic Logic
– ident: BIB008
  article-title: Knowledge representation, reasoning and declarative problem solving with answer sets, Unpublished manuscript
– start-page: 463
  year: 1969
  end-page: 502
  ident: BIB084
  article-title: Some philosophical problems from the standpoint of artificial intelligence
  publication-title: Machine Intelligence, Vol. 4
– volume: 1
  start-page: 51
  year: 1994
  end-page: 60
  ident: BIB043
  article-title: Consistency of Clark's completion and existence of stable models
  publication-title: J. Methods Logic Comput. Sci.
– volume: 13
  start-page: 13
  year: 2000
  end-page: 18
  ident: BIB024
  article-title: Project report on LP+: A second generation logic programming language
  publication-title: AI Comm.
– start-page: 79
  year: 2000
  end-page: 103
  ident: BIB028
  article-title: Declarative problem solving using the
  publication-title: Logic Based AI
– start-page: 166
  year: 1991
  end-page: 180
  ident: BIB025
  article-title: Classifying semantics of logic programs
  publication-title: Proc. International Workshop in Logic Programming and Non-Monotonic Reasoning, Washington, DC
– start-page: 822
  year: 2000
  end-page: 836
  ident: BIB039
  article-title: Wire routing and satisfiability planning
  publication-title: Proc. CL-2000
– volume: 77
  start-page: 285
  year: 1995
  end-page: 319
  ident: BIB059
  article-title: A comparative study of open default theories
  publication-title: Artificial Intelligence
– start-page: 115
  year: 1993
  end-page: 131
  ident: BIB080
  article-title: Reflexive autoepistemic logic and logic programming
  publication-title: Proc. Second Internat. Workshop on Logic Programming and Non-Monotonic Reasoning, Lisbon
– start-page: 439
  year: 1985
  end-page: 457
  ident: BIB046
  article-title: Theoretical foundations for nonmonotonic reasoning in expert systems
  publication-title: Proc. NATO Advanced Study Institute on Logics and Models of Concurrent Systems, La Colle-sur-Loup, France
– volume: 26
  start-page: 89
  year: 1986
  end-page: 116
  ident: BIB086
  article-title: Applications of circumscription to formalizing common sense knowledge
  publication-title: Artificial Intelligence
– start-page: 132
  year: 1993
  end-page: 150
  ident: BIB020
  article-title: Minimal knowledge + negation as failure = only knowing (sometimes)
  publication-title: Proc. Second Internat. Workshop on Logic Programming and Nonmonotonic Reasoning, Lisbon
– volume: 91
  start-page: 15
  year: 1991
  end-page: 54
  ident: BIB012
  article-title: General logical databases and programs: Default logic semantics and stratification
  publication-title: J. Inform. Comput.
– reference: P. Simons, I. Niemelä, T. Soininen, Extending and implementing the stable model semantics, Artificial Intelligence 138 (2002) 181–234, this issue
– reference: J.J. Alferes, L.M. Pereira, H. Przymusinska, T.C. Przymusinski, LUPS—A language for updating logic programs, Artificial Intelligence 138 (2002) 87–116, this issue
– start-page: 105
  year: 1973
  end-page: 118
  ident: BIB056
  article-title: Computation and deduction
  publication-title: Proc. Second Symposium on Mathematical Foundations of Computer Science
– volume: 19–20
  start-page: 9
  year: 1994
  end-page: 71
  ident: BIB007
  article-title: Logic Programming and negation: A survey
  publication-title: J. Logic Programming
– start-page: 243
  year: 1989
  end-page: 257
  ident: BIB078
  article-title: Stable semantics for logic programs and default reasoning
  publication-title: Proc. North American Conference on Logic Programming, Cleveland, OH
– volume: 1551
  start-page: 305
  year: 1999
  end-page: 319
  ident: BIB100
  article-title: Developing a declarative rule language for applications in program configuration
  publication-title: Practical Aspects of Declarative Languages
– start-page: 292
  year: 1982
  end-page: 308
  ident: BIB090
  article-title: On indefinite data bases and the closed world assumption
  publication-title: Proc. CADE-82, New York
– start-page: 11
  year: 1989
  end-page: 21
  ident: BIB108
  article-title: Every logic program has a natural stratification and an iterated fixed point model
  publication-title: Proc. 8th Symposium on Principles of Database Systems, Philadelphia, PA
– year: 1996
  ident: BIB001
  publication-title: Reasoning with Logic Programming
– volume: 1265
  start-page: 363
  year: 1997
  end-page: 374
  ident: BIB027
  article-title: A deductive system for nonmonotonic reasoning
  publication-title: Proc. 4th Logic Programming and Non-Monotonic Reasoning Conference (LPNMR-97)
– volume: 13
  start-page: 41
  year: 1980
  end-page: 72
  ident: BIB089
  article-title: Nonmonotonic logic I
  publication-title: Artificial Intelligence
– volume: 13
  start-page: 1
  year: 1992
  end-page: 22
  ident: BIB113
  article-title: A procedural semantics for well-founded negation in logic programs
  publication-title: J. Logic Programming
– start-page: 177
  year: 1988
  end-page: 192
  ident: BIB068
  article-title: On the declarative semantics of logic programs with negation
  publication-title: Foundations of Deductive Databases and Logic Programming
– volume: 526
  start-page: 265
  year: 1991
  end-page: 289
  ident: BIB005
  article-title: Proving termination in general prolog programs
  publication-title: Proc. Internat. Conference on Theoretical Aspects of Computer Software
– year: 1997
  ident: BIB017
  publication-title: Nonmonotonic Reasoning: An Overview
– volume: 24
  start-page: 161
  year: 1995
  end-page: 201
  ident: BIB021
  article-title: Efficient top-down computation of queries under the well-founded semantics
  publication-title: J. Logic Programming
– reference: A. Colmerauer, H. Kanoui, R. Pasero, P. Roussel, Un systeme de communication homme-machine en Francais, Technical Report, Groupe de Intelligence Artificielle Université de Aix-Marseilles II, Marseilles, 1973
– start-page: 272
  year: 1990
  end-page: 277
  ident: BIB038
  article-title: Computing stable models by using the ATMS
  publication-title: Proc. AAAI-90, Boston, MA
– year: 2000
  ident: BIB093
  publication-title: Logic-Based Artificial Intelligence
– volume: 135
  start-page: 69
  year: 1997
  end-page: 112
  ident: BIB066
  article-title: Disjunctive stable models: Unfounded sets, fixpoint semantics and computation
  publication-title: Inform. and Comput.
– year: 1997
  ident: BIB003
  publication-title: From Logic Programming to Prolog
– start-page: 418
  year: 1982
  end-page: 420
  ident: BIB112
  article-title: Circumscription implies predicate completion (sometimes)
  publication-title: Proc. AAAI-82, Pittsburgh, PA
– start-page: 1106
  year: 1988
  end-page: 1120
  ident: BIB109
  article-title: Weakly perfect model semantics for logic programs
  publication-title: Proc. 5th International Conference and Symposium on Logic Programming, Seattle, WA
– start-page: 119
  year: 1978
  end-page: 140
  ident: BIB110
  article-title: On closed world data bases
  publication-title: Logic and Data Bases
– volume: 12
  start-page: 53
  year: 1994
  end-page: 87
  ident: BIB011
  article-title: Propositional semantics for disjunctive logic programs
  publication-title: Ann. Math. Artificial Intelligence
– volume: 7
  start-page: 231
  year: 1989
  end-page: 245
  ident: BIB064
  article-title: Signed data dependencies in logic programs
  publication-title: J. Logic Programming
– start-page: 375
  year: 1999
  end-page: 398
  ident: BIB081
  article-title: Stable models and an alternative logic programming paradigm
  publication-title: The Logic Programming Paradigm: A 25-Year Perspective
– ident: BIB101
  article-title: Logic, Programming and Prolog
– volume: 38
  start-page: 620
  year: 1991
  end-page: 650
  ident: BIB125
  article-title: The well-founded semantics for general logic programs
  publication-title: J. ACM
– start-page: 135
  year: 1999
  end-page: 139
  ident: BIB040
  article-title: Using database optimization techniques for nonmonotonic reasoning
  publication-title: Proc. 7th International Workshop on Deductive Databases and Logic Programming (DDLP-99), Japan
– volume: 27
  start-page: 229
  year: 1985
  end-page: 235
  ident: BIB067
  article-title: Closed-world databases and circumscription
  publication-title: Artificial Intelligence
– volume: 19,20
  start-page: 73
  year: 1994
  end-page: 148
  ident: BIB009
  article-title: Logic programming and knowledge representation
  publication-title: J. Logic Programming
– volume: 93
  start-page: 63
  year: 1997
  end-page: 101
  ident: BIB016
  article-title: An abstract, argumentation-theoretic approach to default reasoning
  publication-title: Artificial Intelligence
– year: 1994
  ident: BIB103
  publication-title: Computational Complexity
– volume: 3
  start-page: 588
  year: 1991
  end-page: 619
  ident: BIB079
  article-title: Autoepistemic logic
  publication-title: J. ACM
– reference: D. Pearce, G. Wagner, Reasoning with negative information 1—Strong negation in logic programming, Technical Report, Gruppe fur Logic, Wissentheorie and Information, Freie Universität Berlin, 1989
– volume: 16
  start-page: 687
  year: 1994
  end-page: 726
  ident: BIB006
  article-title: On the occur-check free logic programs
  publication-title: ACM Trans. Program. Language Systems
– volume: 22
  start-page: 364
  year: 1997
  end-page: 418
  ident: BIB029
  article-title: Disjunctive Datalog
  publication-title: ACM Trans. Database Systems
– start-page: 298
  year: 1994
  end-page: 352
  ident: BIB073
  article-title: Circumscription
  publication-title: The Handbook on Logic in AI and Logic Programming, Vol. 3
– volume: 15
  start-page: 289
  year: 1995
  end-page: 323
  ident: BIB035
  article-title: On the computational cost of disjunctive logic programming: Propositional case
  publication-title: Ann. Math. Artificial Intelligence
– start-page: 35
  year: 1993
  end-page: 110
  ident: BIB075
  article-title: General patterns in nonmonotonic reasoning
  publication-title: The Handbook on Logic in AI and Logic Programming, Vol. 3
– year: 1999
  ident: BIB106
  article-title: From here to there: Stable negation in logic programming
  publication-title: What is Negation?
– start-page: 234
  year: 1999
  end-page: 299
  ident: BIB092
  article-title: Logic and Databases: A 20 year retrospective
  publication-title: Logical Foundations for Cognitive Agents: Contributions in Honor of Ray Reiter
– volume: 25
  start-page: 241
  year: 1999
  end-page: 273
  ident: BIB098
  article-title: Logic programs with stable model semantics as a constraint programming paradigm
  publication-title: Ann. Math. Artificial Intelligence
– volume: 29
  start-page: 33
  year: 1982
  end-page: 57
  ident: BIB088
  article-title: Nonmonotonic logic II: Nonmonotonic modal theories
  publication-title: J. ACM
– year: 1997
  ident: BIB097
  publication-title: Logic for Applications
– start-page: 569
  year: 1974
  end-page: 574
  ident: BIB061
  article-title: Predicate logic as a programming language
  publication-title: Information Processing 74, Proceedings of IFIP Congress 74, Stockholm, Sweden
– start-page: 257
  year: 2000
  end-page: 279
  ident: BIB010
  article-title: Reasoning agents in dynamic domains
  publication-title: Logic Based AI
– volume: 12
  start-page: 1
  year: 1994
  end-page: 24
  ident: BIB091
  article-title: Overview of disjunctive logic programming
  publication-title: Ann. Math Artificial Intelligence
– reference: M. Minsky, A framework for representing knowledge, in: P. Winston (Ed.), The Psychology of Computer Vision, McGraw-Hill, New York, pp. 211–277
– reference: M. Cadoli, T. Eiter, G. Gottlob, Default logic as a query language, IEEE Trans. Knowledge Data Engrg. 9 (3) 448–463
– volume: 1216
  start-page: 57
  year: 1997
  end-page: 70
  ident: BIB105
  article-title: A new logical characterization of stable models and answer sets
  publication-title: Nonmonotonic Extensions of Logic Programming
– start-page: 417
  year: 2000
  end-page: 422
  ident: BIB034
  article-title: Solving advanced reasoning tasks using quantified boolean formulas
  publication-title: Proc. AAAI-00 2000, Austin, TX
– start-page: 212
  year: 1989
  end-page: 221
  ident: BIB065
  article-title: What does a conditional knowledge base entail?
  publication-title: Proc. KR-89, Toronto, ON
– start-page: 635
  year: 2001
  end-page: 640
  ident: BIB042
  article-title: Experimenting with heuristics for answer set programming
  publication-title: Proc. IJCAI-01, Seattle, WA
– start-page: 80
  year: 1990
  end-page: 95
  ident: BIB069
  article-title: On open defaults
  publication-title: Computational Logic: Symposium Proceedings
– reference: V. Marek, I. Pivkina, M. Truszczyński, Annotated revision programs, Artificial Intelligence 138 (2002) 149–180, this issue
– start-page: 365
  year: 1991
  end-page: 387
  ident: BIB050
  article-title: Classical negation in logic programs and disjunctive databases
  publication-title: New Generation Comput.
– volume: 1
  start-page: 487
  year: 2001
  end-page: 495
  ident: BIB123
  article-title: Order-consistent programs are cautiously monotonic
  publication-title: Theory and Practice of Logic Programming
– start-page: 127
  year: 1984
  end-page: 138
  ident: BIB121
  article-title: Unfold/fold transformation of logic programs
  publication-title: Proc. 2nd International Logic Programming Conference, Uppsala, Sweden
– year: 1992
  ident: BIB074
  publication-title: Foundations of Disjunctive Logic Programming
– volume: 206
  start-page: 181
  year: 1998
  end-page: 218
  ident: BIB036
  article-title: Expressive power and complexity of partial models for disjunctive deductive databases
  publication-title: Theoret. Comput. Sci.
– start-page: 69
  year: 1996
  end-page: 128
  ident: BIB071
  article-title: Foundations of logic programming
  publication-title: Principles of Knowledge Representation
– start-page: 421
  year: 1997
  end-page: 430
  ident: BIB099
  article-title: Smodels—An implementation of the stable model and well-founded semantics for normal logic programs
  publication-title: Proc. 4th International Conference on Logic Programming and Non-Monotonic Reasoning, Dagstuhl, Germany
– reference: B. Cui, T. Swift, Preference Logic grammars: Semantics, standardization, and application to data standardization, Artificial Intelligence 138 (2002) 117–147, this issue
– year: 1979
  ident: BIB062
  publication-title: Logic for Problem Solving
– volume: 23
  start-page: 733
  year: 1976
  end-page: 742
  ident: BIB124
  article-title: The semantics of predicate logic as a programming language
  publication-title: J. ACM
– volume: 43
  start-page: 219
  year: 1990
  end-page: 234
  ident: BIB037
  article-title: A rational reconstruction of nonmonotonic truth maintenance systems
  publication-title: Artificial Intelligence
– year: 2000
  ident: BIB014
  article-title: Fages' theorem and answer set programming
  publication-title: Proc. 8th International Workshop on Non-Monotonic Reasoning, Breckeridge, CO
– volume: 52
  start-page: 1
  year: 1987
  end-page: 43
  ident: BIB119
  article-title: Classifying the computational complexity of problems
  publication-title: J. Symbolic Logic
– start-page: 427
  year: 1990
  end-page: 441
  ident: BIB047
  article-title: Generalized stable models, truth maintenance and conflict resolution
  publication-title: Logic Programming: Proc. Seventh International Conference
– volume: 49
  start-page: 334
  year: 1994
  end-page: 361
  ident: BIB127
  article-title: A three-valued semantics for deductive databases and logic programs
  publication-title: J. Comput. System Sci.
– start-page: 207
  year: 1987
  end-page: 211
  ident: BIB048
  article-title: On stratified autoepistemic theories
  publication-title: Proc. AAAI-87, Seattle, WA
– year: 2000
  ident: BIB033
  article-title: dcs: An implementation of DATALOG with Constraints
  publication-title: Proc. 8th International Workshop on Nonmonotonic Reasoning (NMR-2000), Breckenridge, CO
– start-page: 89
  year: 1988
  end-page: 148
  ident: BIB004
  article-title: Towards a theory of declarative knowledge
  publication-title: Foundations of Deductive Databases and Logic Programming
– start-page: 235
  year: 1998
  end-page: 324
  ident: BIB057
  article-title: The role of abduction in logic programming
  publication-title: Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. 5
– reference: V. Lifschitz, Answer set programming and plan generation, Artificial Intelligence 138 (2002) 39–54, this issue
– volume: 13
  start-page: 27
  year: 1980
  end-page: 39
  ident: BIB085
  article-title: Circumscription—A form of nonmonotonic reasoning
  publication-title: Artificial Intelligence
– start-page: 183
  year: 1969
  end-page: 205
  ident: BIB055
  article-title: Theorem proving by resolution as a basis for question—Answering systems
  publication-title: Machine Intelligence, Vol. 4
– volume: 4
  start-page: 289
  year: 1987
  end-page: 308
  ident: BIB063
  article-title: Negation in logic programming
  publication-title: J. Logic Programming
– volume: 1471
  start-page: 164
  year: 1998
  end-page: 224
  ident: BIB052
  article-title: Reasoning with prioritized defaults
  publication-title: Lecture Notes in Artificial Intelligence
– volume: 31
  start-page: 245
  year: 1997
  end-page: 298
  ident: BIB122
  article-title: Representing actions in logic programs and default theories
  publication-title: J. Logic Programming
– volume: 27
  start-page: 89
  year: 1996
  end-page: 106
  ident: BIB026
  article-title: Completeness of SLDNF-resolution for nonfloundering queries
  publication-title: J. Logic Programming
– volume: 15
  start-page: 337
  year: 1993
  end-page: 355
  ident: BIB120
  article-title: A completeness result for SLDNF-resolution
  publication-title: J. Logic Programming
– start-page: 518
  year: 1996
  end-page: 528
  ident: BIB022
  article-title: Default reasoning system DeReSe
  publication-title: Proc. Internat. Conference on Principles of Knowledge Representation and Reasoning
– start-page: 23
  year: 1994
  end-page: 42
  ident: BIB053
  article-title: Complexity and expressive power of disjunctive logic programming
  publication-title: Proc. International Logic Programming Symposium (ILPS-94), Ithaca, NY
– volume: 96
  start-page: 467
  year: 1997
  end-page: 479
  ident: BIB058
  article-title: A note on the stable model semantics of logic programs
  publication-title: Artificial Intelligence
– start-page: 75
  year: 1959
  end-page: 91
  ident: BIB083
  article-title: Programs with common sense
  publication-title: Proc. Teddington Conference on the Mechanization of Thought Processes, Her Majesty's Stationery Office, London
– volume: 13
  start-page: 81
  year: 1980
  end-page: 132
  ident: BIB111
  article-title: A logic for default reasoning
  publication-title: Artificial Intelligence
– year: 1997
  ident: BIB116
  publication-title: Solving the Frame Problem: A Mathematical Investigation of the Commonsense Law of Inertia
– volume: 34
  start-page: 67
  year: 1998
  end-page: 110
  ident: BIB015
  article-title: Tabulated resolution for the well-founded semantics
  publication-title: J. Logic Programming
– reference: G. Gottlob, F. Scarcello, M. Sideri, Fixed-parameter complexity in AI and nonmonotonic reasoning, Artificial Intelligence 130 (2002) 55–86, this issue
– reference: M. Gelfond, V. Lifschitz, Representing actions and change by logic programs, J. Logic Programming 17, 301–323
– start-page: 101
  year: 1993
  end-page: 114
  ident: BIB070
  article-title: Extended logic programs as autoepistemic theories
  publication-title: Proc. Second Internat. Workshop on Logic Programming and Non-Monotonic Reasoning, Lisbon
– start-page: 600
  year: 1989
  end-page: 617
  ident: BIB077
  article-title: The relationship between logic program semantics and nonmonotonic reasoning
  publication-title: Proc. Sixth Internat. Conference on Logic Programming, Lisbon, Portugal
– volume: 1
  start-page: 835
  year: 1991
  end-page: 861
  ident: BIB126
  article-title: Logic programming with strong negation and inexact predicates
  publication-title: J. Logic Comput.
– volume: 25
  start-page: 75
  year: 1985
  end-page: 94
  ident: BIB095
  article-title: Semantical considerations on nonmonotonic logic
  publication-title: Artificial Intelligence
– volume: 2
  start-page: 295
  year: 1985
  end-page: 312
  ident: BIB044
  article-title: A Kripke–Kleene semantics for logic programs
  publication-title: J. Logic Programming
– year: 2001
  ident: BIB045
  article-title: Census data repair: A challenging application of disjunctive logic programming
  publication-title: Proc. LPAR-01, Cuba
– volume: 14
  start-page: 16
  year: 1949
  end-page: 26
  ident: BIB096
  article-title: Constructible falsity
  publication-title: J. Symbolic Logic
– start-page: 293
  year: 1978
  end-page: 322
  ident: BIB030
  article-title: Negation as failure
  publication-title: Logic and Data Bases
– start-page: 1070
  year: 1988
  end-page: 1080
  ident: BIB049
  article-title: The stable model semantics for logic programming
  publication-title: Logic Programming: Proc. Fifth Internat. Conference and Symposium
– volume: 79
  start-page: 86
  year: 1991
  end-page: 112
  ident: BIB013
  article-title: Negation by default and unstratifiable logic programs
  publication-title: Theoret. Comput. Sci.
– volume: 123
  start-page: 185
  year: 2000
  end-page: 222
  ident: BIB115
  article-title: Prioritized logic programming and its application to commonsense reasoning
  publication-title: Artificial Intelligence
– volume: 1730
  start-page: 177
  year: 1999
  end-page: 191
  ident: BIB041
  article-title: Pushing goal derivation in DLP computations
  publication-title: Proc. 5th International Conference on Logic Programming and Non-Monotonic Reasoning (LPNMR-99), El Paso, TX
– ident: 10.1016/S0004-3702(02)00207-2_BIB019
– start-page: 177
  year: 1988
  ident: 10.1016/S0004-3702(02)00207-2_BIB068
  article-title: On the declarative semantics of logic programs with negation
– year: 1997
  ident: 10.1016/S0004-3702(02)00207-2_BIB003
– volume: 15
  start-page: 289
  issue: 3–4
  year: 1995
  ident: 10.1016/S0004-3702(02)00207-2_BIB035
  article-title: On the computational cost of disjunctive logic programming: Propositional case
  publication-title: Ann. Math. Artificial Intelligence
  doi: 10.1007/BF01536399
– volume: 13
  start-page: 27
  issue: 1–2
  year: 1980
  ident: 10.1016/S0004-3702(02)00207-2_BIB085
  article-title: Circumscription—A form of nonmonotonic reasoning
  publication-title: Artificial Intelligence
  doi: 10.1016/0004-3702(80)90011-9
– volume: 27
  start-page: 89
  issue: 2
  year: 1996
  ident: 10.1016/S0004-3702(02)00207-2_BIB026
  article-title: Completeness of SLDNF-resolution for nonfloundering queries
  publication-title: J. Logic Programming
  doi: 10.1016/0743-1066(95)00118-2
– volume: 16
  start-page: 687
  issue: 3
  year: 1994
  ident: 10.1016/S0004-3702(02)00207-2_BIB006
  article-title: On the occur-check free logic programs
  publication-title: ACM Trans. Program. Language Systems
  doi: 10.1145/177492.177673
– volume: 93
  start-page: 63
  issue: 1–2
  year: 1997
  ident: 10.1016/S0004-3702(02)00207-2_BIB016
  article-title: An abstract, argumentation-theoretic approach to default reasoning
  publication-title: Artificial Intelligence
  doi: 10.1016/S0004-3702(97)00015-5
– start-page: 166
  year: 1991
  ident: 10.1016/S0004-3702(02)00207-2_BIB025
  article-title: Classifying semantics of logic programs
– start-page: 417
  year: 2000
  ident: 10.1016/S0004-3702(02)00207-2_BIB034
  article-title: Solving advanced reasoning tasks using quantified boolean formulas
– start-page: 193
  year: 1988
  ident: 10.1016/S0004-3702(02)00207-2_BIB107
  article-title: On the declarative semantics of deductive databases and logic programs
– ident: 10.1016/S0004-3702(02)00207-2_BIB018
  doi: 10.1109/69.599933
– volume: 135
  start-page: 69
  issue: 2
  year: 1997
  ident: 10.1016/S0004-3702(02)00207-2_BIB066
  article-title: Disjunctive stable models: Unfounded sets, fixpoint semantics and computation
  publication-title: Inform. and Comput.
  doi: 10.1006/inco.1997.2630
– year: 1999
  ident: 10.1016/S0004-3702(02)00207-2_BIB106
  article-title: From here to there: Stable negation in logic programming
– ident: 10.1016/S0004-3702(02)00207-2_BIB118
  doi: 10.1016/S0004-3702(02)00187-X
– start-page: 80
  year: 1990
  ident: 10.1016/S0004-3702(02)00207-2_BIB069
  article-title: On open defaults
– volume: 1348
  start-page: 169
  year: 1997
  ident: 10.1016/S0004-3702(02)00207-2_BIB032
  article-title: Encoding planning problems in nonmonotonic logic programs
– volume: 77
  start-page: 285
  issue: 2
  year: 1995
  ident: 10.1016/S0004-3702(02)00207-2_BIB059
  article-title: A comparative study of open default theories
  publication-title: Artificial Intelligence
  doi: 10.1016/0004-3702(94)00035-Y
– year: 1992
  ident: 10.1016/S0004-3702(02)00207-2_BIB074
– volume: 9
  start-page: 33
  year: 1990
  ident: 10.1016/S0004-3702(02)00207-2_BIB114
  article-title: Completed logic programs and their consistency
  publication-title: J. Logic Programming
  doi: 10.1016/0743-1066(90)90032-Z
– volume: 4
  start-page: 289
  issue: 4
  year: 1987
  ident: 10.1016/S0004-3702(02)00207-2_BIB063
  article-title: Negation in logic programming
  publication-title: J. Logic Programming
  doi: 10.1016/0743-1066(87)90007-0
– volume: 1990
  start-page: 169
  year: 2001
  ident: 10.1016/S0004-3702(02)00207-2_BIB102
  article-title: A-Prolog decision support system for the Space Shuttle
– volume: 15
  start-page: 337
  year: 1993
  ident: 10.1016/S0004-3702(02)00207-2_BIB120
  article-title: A completeness result for SLDNF-resolution
  publication-title: J. Logic Programming
  doi: 10.1016/S0743-1066(14)80003-4
– volume: 23
  start-page: 733
  issue: 4
  year: 1976
  ident: 10.1016/S0004-3702(02)00207-2_BIB124
  article-title: The semantics of predicate logic as a programming language
  publication-title: J. ACM
  doi: 10.1145/321978.321991
– volume: 1265
  start-page: 363
  year: 1997
  ident: 10.1016/S0004-3702(02)00207-2_BIB027
  article-title: A deductive system for nonmonotonic reasoning
– year: 2000
  ident: 10.1016/S0004-3702(02)00207-2_BIB014
  article-title: Fages' theorem and answer set programming
– start-page: 463
  year: 1969
  ident: 10.1016/S0004-3702(02)00207-2_BIB084
  article-title: Some philosophical problems from the standpoint of artificial intelligence
– volume: 3
  start-page: 588
  issue: 38
  year: 1991
  ident: 10.1016/S0004-3702(02)00207-2_BIB079
  article-title: Autoepistemic logic
  publication-title: J. ACM
– start-page: 212
  year: 1998
  ident: 10.1016/S0004-3702(02)00207-2_BIB087
  article-title: Satisfiability planning with causal theories
– ident: 10.1016/S0004-3702(02)00207-2_BIB023
– volume: 1
  start-page: 835
  issue: 6
  year: 1991
  ident: 10.1016/S0004-3702(02)00207-2_BIB126
  article-title: Logic programming with strong negation and inexact predicates
  publication-title: J. Logic Comput.
  doi: 10.1093/logcom/1.6.835
– start-page: 822
  year: 2000
  ident: 10.1016/S0004-3702(02)00207-2_BIB039
  article-title: Wire routing and satisfiability planning
– volume: 19,20
  start-page: 73
  year: 1994
  ident: 10.1016/S0004-3702(02)00207-2_BIB009
  article-title: Logic programming and knowledge representation
  publication-title: J. Logic Programming
  doi: 10.1016/0743-1066(94)90025-6
– start-page: 234
  year: 1999
  ident: 10.1016/S0004-3702(02)00207-2_BIB092
  article-title: Logic and Databases: A 20 year retrospective
– start-page: 257
  year: 2000
  ident: 10.1016/S0004-3702(02)00207-2_BIB010
  article-title: Reasoning agents in dynamic domains
– start-page: 132
  year: 1993
  ident: 10.1016/S0004-3702(02)00207-2_BIB020
  article-title: Minimal knowledge + negation as failure = only knowing (sometimes)
– volume: 52
  start-page: 1
  issue: 1
  year: 1987
  ident: 10.1016/S0004-3702(02)00207-2_BIB119
  article-title: Classifying the computational complexity of problems
  publication-title: J. Symbolic Logic
  doi: 10.2307/2273858
– ident: 10.1016/S0004-3702(02)00207-2_BIB002
  doi: 10.1016/S0004-3702(02)00183-2
– start-page: 70
  year: 1999
  ident: 10.1016/S0004-3702(02)00207-2_BIB060
  article-title: Stable model checking made easy
– start-page: 421
  year: 1997
  ident: 10.1016/S0004-3702(02)00207-2_BIB099
  article-title: Smodels—An implementation of the stable model and well-founded semantics for normal logic programs
– start-page: 600
  year: 1989
  ident: 10.1016/S0004-3702(02)00207-2_BIB077
  article-title: The relationship between logic program semantics and nonmonotonic reasoning
– year: 1994
  ident: 10.1016/S0004-3702(02)00207-2_BIB103
– volume: 49
  start-page: 334
  year: 1994
  ident: 10.1016/S0004-3702(02)00207-2_BIB127
  article-title: A three-valued semantics for deductive databases and logic programs
  publication-title: J. Comput. System Sci.
  doi: 10.1016/S0022-0000(05)80053-4
– volume: 13
  start-page: 1
  year: 1992
  ident: 10.1016/S0004-3702(02)00207-2_BIB113
  article-title: A procedural semantics for well-founded negation in logic programs
  publication-title: J. Logic Programming
  doi: 10.1016/0743-1066(92)90019-Y
– volume: 1551
  start-page: 305
  year: 1999
  ident: 10.1016/S0004-3702(02)00207-2_BIB100
  article-title: Developing a declarative rule language for applications in program configuration
– volume: 24
  start-page: 161
  issue: 3
  year: 1995
  ident: 10.1016/S0004-3702(02)00207-2_BIB021
  article-title: Efficient top-down computation of queries under the well-founded semantics
  publication-title: J. Logic Programming
  doi: 10.1016/0743-1066(94)00028-5
– volume: 91
  start-page: 15
  issue: 1
  year: 1991
  ident: 10.1016/S0004-3702(02)00207-2_BIB012
  article-title: General logical databases and programs: Default logic semantics and stratification
  publication-title: J. Inform. Comput.
  doi: 10.1016/0890-5401(91)90073-B
– start-page: 75
  year: 1959
  ident: 10.1016/S0004-3702(02)00207-2_BIB083
  article-title: Programs with common sense
– volume: 1216
  start-page: 57
  year: 1997
  ident: 10.1016/S0004-3702(02)00207-2_BIB105
  article-title: A new logical characterization of stable models and answer sets
– start-page: 183
  year: 1969
  ident: 10.1016/S0004-3702(02)00207-2_BIB055
  article-title: Theorem proving by resolution as a basis for question—Answering systems
– volume: 79
  start-page: 86
  issue: 1
  year: 1991
  ident: 10.1016/S0004-3702(02)00207-2_BIB013
  article-title: Negation by default and unstratifiable logic programs
  publication-title: Theoret. Comput. Sci.
– year: 1979
  ident: 10.1016/S0004-3702(02)00207-2_BIB062
– start-page: 418
  year: 1982
  ident: 10.1016/S0004-3702(02)00207-2_BIB112
  article-title: Circumscription implies predicate completion (sometimes)
– year: 2001
  ident: 10.1016/S0004-3702(02)00207-2_BIB045
  article-title: Census data repair: A challenging application of disjunctive logic programming
– volume: 25
  start-page: 75
  issue: 1
  year: 1985
  ident: 10.1016/S0004-3702(02)00207-2_BIB095
  article-title: Semantical considerations on nonmonotonic logic
  publication-title: Artificial Intelligence
  doi: 10.1016/0004-3702(85)90042-6
– volume: 29
  start-page: 33
  issue: 1
  year: 1982
  ident: 10.1016/S0004-3702(02)00207-2_BIB088
  article-title: Nonmonotonic logic II: Nonmonotonic modal theories
  publication-title: J. ACM
  doi: 10.1145/322290.322293
– start-page: 260
  year: 1991
  ident: 10.1016/S0004-3702(02)00207-2_BIB117
  article-title: Autoepistemic logic of knowledge
– year: 1997
  ident: 10.1016/S0004-3702(02)00207-2_BIB097
– year: 1996
  ident: 10.1016/S0004-3702(02)00207-2_BIB001
– start-page: 23
  year: 1994
  ident: 10.1016/S0004-3702(02)00207-2_BIB053
  article-title: Complexity and expressive power of disjunctive logic programming
– start-page: 127
  year: 1984
  ident: 10.1016/S0004-3702(02)00207-2_BIB121
  article-title: Unfold/fold transformation of logic programs
– year: 1997
  ident: 10.1016/S0004-3702(02)00207-2_BIB116
– volume: 31
  start-page: 245
  issue: 1–3
  year: 1997
  ident: 10.1016/S0004-3702(02)00207-2_BIB122
  article-title: Representing actions in logic programs and default theories
  publication-title: J. Logic Programming
  doi: 10.1016/S0743-1066(96)00125-2
– volume: 25
  start-page: 241
  issue: 3–4
  year: 1999
  ident: 10.1016/S0004-3702(02)00207-2_BIB098
  article-title: Logic programs with stable model semantics as a constraint programming paradigm
  publication-title: Ann. Math. Artificial Intelligence
  doi: 10.1023/A:1018930122475
– start-page: 375
  year: 1999
  ident: 10.1016/S0004-3702(02)00207-2_BIB081
  article-title: Stable models and an alternative logic programming paradigm
– year: 1993
  ident: 10.1016/S0004-3702(02)00207-2_BIB082
– year: 1997
  ident: 10.1016/S0004-3702(02)00207-2_BIB017
– volume: 1
  start-page: 51
  issue: 1
  year: 1994
  ident: 10.1016/S0004-3702(02)00207-2_BIB043
  article-title: Consistency of Clark's completion and existence of stable models
  publication-title: J. Methods Logic Comput. Sci.
– start-page: 569
  year: 1974
  ident: 10.1016/S0004-3702(02)00207-2_BIB061
  article-title: Predicate logic as a programming language
– start-page: 11
  year: 1989
  ident: 10.1016/S0004-3702(02)00207-2_BIB108
  article-title: Every logic program has a natural stratification and an iterated fixed point model
– volume: 34
  start-page: 67
  issue: 2
  year: 1998
  ident: 10.1016/S0004-3702(02)00207-2_BIB015
  article-title: Tabulated resolution for the well-founded semantics
  publication-title: J. Logic Programming
  doi: 10.1016/S0743-1066(97)00073-3
– ident: 10.1016/S0004-3702(02)00207-2_BIB054
  doi: 10.1016/S0004-3702(02)00182-0
– start-page: 635
  year: 2001
  ident: 10.1016/S0004-3702(02)00207-2_BIB042
  article-title: Experimenting with heuristics for answer set programming
– volume: 12
  start-page: 53
  year: 1994
  ident: 10.1016/S0004-3702(02)00207-2_BIB011
  article-title: Propositional semantics for disjunctive logic programs
  publication-title: Ann. Math. Artificial Intelligence
  doi: 10.1007/BF01530761
– volume: 206
  start-page: 181
  issue: 1–2
  year: 1998
  ident: 10.1016/S0004-3702(02)00207-2_BIB036
  article-title: Expressive power and complexity of partial models for disjunctive deductive databases
  publication-title: Theoret. Comput. Sci.
  doi: 10.1016/S0304-3975(97)00129-1
– volume: 1471
  start-page: 164
  year: 1998
  ident: 10.1016/S0004-3702(02)00207-2_BIB052
  article-title: Reasoning with prioritized defaults
– volume: 13
  start-page: 81
  issue: 1–2
  year: 1980
  ident: 10.1016/S0004-3702(02)00207-2_BIB111
  article-title: A logic for default reasoning
  publication-title: Artificial Intelligence
  doi: 10.1016/0004-3702(80)90014-4
– ident: 10.1016/S0004-3702(02)00207-2_BIB094
  doi: 10.1016/B978-1-4832-1446-7.50018-2
– start-page: 79
  year: 2000
  ident: 10.1016/S0004-3702(02)00207-2_BIB028
  article-title: Declarative problem solving using the dlv system
– ident: 10.1016/S0004-3702(02)00207-2_BIB031
  doi: 10.1016/S0004-3702(02)00185-6
– start-page: 272
  year: 1990
  ident: 10.1016/S0004-3702(02)00207-2_BIB038
  article-title: Computing stable models by using the ATMS
– start-page: 207
  year: 1987
  ident: 10.1016/S0004-3702(02)00207-2_BIB048
  article-title: On stratified autoepistemic theories
– start-page: 235
  year: 1998
  ident: 10.1016/S0004-3702(02)00207-2_BIB057
  article-title: The role of abduction in logic programming
– year: 2000
  ident: 10.1016/S0004-3702(02)00207-2_BIB093
– ident: 10.1016/S0004-3702(02)00207-2_BIB072
  doi: 10.1016/S0004-3702(02)00186-8
– ident: 10.1016/S0004-3702(02)00207-2_BIB104
– volume: 123
  start-page: 185
  issue: 1–2
  year: 2000
  ident: 10.1016/S0004-3702(02)00207-2_BIB115
  article-title: Prioritized logic programming and its application to commonsense reasoning
  publication-title: Artificial Intelligence
  doi: 10.1016/S0004-3702(00)00054-0
– start-page: 135
  year: 1999
  ident: 10.1016/S0004-3702(02)00207-2_BIB040
  article-title: Using database optimization techniques for nonmonotonic reasoning
– volume: 22
  start-page: 364
  issue: 3
  year: 1997
  ident: 10.1016/S0004-3702(02)00207-2_BIB029
  article-title: Disjunctive Datalog
  publication-title: ACM Trans. Database Systems
  doi: 10.1145/261124.261126
– volume: 14
  start-page: 16
  year: 1949
  ident: 10.1016/S0004-3702(02)00207-2_BIB096
  article-title: Constructible falsity
  publication-title: J. Symbolic Logic
  doi: 10.2307/2268973
– volume: 38
  start-page: 620
  issue: 3
  year: 1991
  ident: 10.1016/S0004-3702(02)00207-2_BIB125
  article-title: The well-founded semantics for general logic programs
  publication-title: J. ACM
  doi: 10.1145/116825.116838
– volume: 19–20
  start-page: 9
  year: 1994
  ident: 10.1016/S0004-3702(02)00207-2_BIB007
  article-title: Logic Programming and negation: A survey
  publication-title: J. Logic Programming
  doi: 10.1016/0743-1066(94)90024-8
– start-page: 298
  year: 1994
  ident: 10.1016/S0004-3702(02)00207-2_BIB073
  article-title: Circumscription
– year: 2000
  ident: 10.1016/S0004-3702(02)00207-2_BIB033
  article-title: dcs: An implementation of DATALOG with Constraints
– start-page: 101
  year: 1993
  ident: 10.1016/S0004-3702(02)00207-2_BIB070
  article-title: Extended logic programs as autoepistemic theories
– start-page: 1070
  year: 1988
  ident: 10.1016/S0004-3702(02)00207-2_BIB049
  article-title: The stable model semantics for logic programming
– volume: 13
  start-page: 13
  issue: 1
  year: 2000
  ident: 10.1016/S0004-3702(02)00207-2_BIB024
  article-title: Project report on LP+: A second generation logic programming language
  publication-title: AI Comm.
– start-page: 439
  year: 1985
  ident: 10.1016/S0004-3702(02)00207-2_BIB046
  article-title: Theoretical foundations for nonmonotonic reasoning in expert systems
– volume: 7
  start-page: 231
  issue: 3
  year: 1989
  ident: 10.1016/S0004-3702(02)00207-2_BIB064
  article-title: Signed data dependencies in logic programs
  publication-title: J. Logic Programming
  doi: 10.1016/0743-1066(89)90022-8
– volume: 2
  start-page: 295
  issue: 4
  year: 1985
  ident: 10.1016/S0004-3702(02)00207-2_BIB044
  article-title: A Kripke–Kleene semantics for logic programs
  publication-title: J. Logic Programming
  doi: 10.1016/S0743-1066(85)80005-4
– volume: 526
  start-page: 265
  year: 1991
  ident: 10.1016/S0004-3702(02)00207-2_BIB005
  article-title: Proving termination in general prolog programs
– start-page: 292
  year: 1982
  ident: 10.1016/S0004-3702(02)00207-2_BIB090
  article-title: On indefinite data bases and the closed world assumption
– start-page: 119
  year: 1978
  ident: 10.1016/S0004-3702(02)00207-2_BIB110
  article-title: On closed world data bases
– ident: 10.1016/S0004-3702(02)00207-2_BIB051
  doi: 10.1016/0743-1066(93)90035-F
– volume: 13
  start-page: 41
  issue: 1–2
  year: 1980
  ident: 10.1016/S0004-3702(02)00207-2_BIB089
  article-title: Nonmonotonic logic I
  publication-title: Artificial Intelligence
  doi: 10.1016/0004-3702(80)90012-0
– volume: 1
  start-page: 487
  issue: 4
  year: 2001
  ident: 10.1016/S0004-3702(02)00207-2_BIB123
  article-title: Order-consistent programs are cautiously monotonic
  publication-title: Theory and Practice of Logic Programming
  doi: 10.1017/S1471068401001144
– volume: 26
  start-page: 89
  issue: 3
  year: 1986
  ident: 10.1016/S0004-3702(02)00207-2_BIB086
  article-title: Applications of circumscription to formalizing common sense knowledge
  publication-title: Artificial Intelligence
  doi: 10.1016/0004-3702(86)90032-9
– volume: 43
  start-page: 219
  year: 1990
  ident: 10.1016/S0004-3702(02)00207-2_BIB037
  article-title: A rational reconstruction of nonmonotonic truth maintenance systems
  publication-title: Artificial Intelligence
  doi: 10.1016/0004-3702(90)90086-F
– volume: 96
  start-page: 467
  issue: 2
  year: 1997
  ident: 10.1016/S0004-3702(02)00207-2_BIB058
  article-title: A note on the stable model semantics of logic programs
  publication-title: Artificial Intelligence
  doi: 10.1016/S0004-3702(97)00058-1
– start-page: 69
  year: 1996
  ident: 10.1016/S0004-3702(02)00207-2_BIB071
  article-title: Foundations of logic programming
– start-page: 89
  year: 1988
  ident: 10.1016/S0004-3702(02)00207-2_BIB004
  article-title: Towards a theory of declarative knowledge
– start-page: 212
  year: 1989
  ident: 10.1016/S0004-3702(02)00207-2_BIB065
  article-title: What does a conditional knowledge base entail?
– start-page: 1106
  year: 1988
  ident: 10.1016/S0004-3702(02)00207-2_BIB109
  article-title: Weakly perfect model semantics for logic programs
– start-page: 105
  year: 1973
  ident: 10.1016/S0004-3702(02)00207-2_BIB056
  article-title: Computation and deduction
– volume: 1730
  start-page: 177
  year: 1999
  ident: 10.1016/S0004-3702(02)00207-2_BIB041
  article-title: Pushing goal derivation in DLP computations
– volume: 27
  start-page: 229
  year: 1985
  ident: 10.1016/S0004-3702(02)00207-2_BIB067
  article-title: Closed-world databases and circumscription
  publication-title: Artificial Intelligence
  doi: 10.1016/0004-3702(85)90055-4
– start-page: 35
  year: 1993
  ident: 10.1016/S0004-3702(02)00207-2_BIB075
  article-title: General patterns in nonmonotonic reasoning
– start-page: 365
  year: 1991
  ident: 10.1016/S0004-3702(02)00207-2_BIB050
  article-title: Classical negation in logic programs and disjunctive databases
  publication-title: New Generation Comput.
  doi: 10.1007/BF03037169
– ident: 10.1016/S0004-3702(02)00207-2_BIB101
– start-page: 518
  year: 1996
  ident: 10.1016/S0004-3702(02)00207-2_BIB022
  article-title: Default reasoning system DeReSe
– start-page: 293
  year: 1978
  ident: 10.1016/S0004-3702(02)00207-2_BIB030
  article-title: Negation as failure
– start-page: 427
  year: 1990
  ident: 10.1016/S0004-3702(02)00207-2_BIB047
  article-title: Generalized stable models, truth maintenance and conflict resolution
– ident: 10.1016/S0004-3702(02)00207-2_BIB008
– ident: 10.1016/S0004-3702(02)00207-2_BIB076
  doi: 10.1016/S0004-3702(02)00184-4
– volume: 12
  start-page: 1
  year: 1994
  ident: 10.1016/S0004-3702(02)00207-2_BIB091
  article-title: Overview of disjunctive logic programming
  publication-title: Ann. Math Artificial Intelligence
  doi: 10.1007/BF01530759
– start-page: 243
  year: 1989
  ident: 10.1016/S0004-3702(02)00207-2_BIB078
  article-title: Stable semantics for logic programs and default reasoning
– start-page: 115
  year: 1993
  ident: 10.1016/S0004-3702(02)00207-2_BIB080
  article-title: Reflexive autoepistemic logic and logic programming
SSID ssj0003991
Score 2.117368
Snippet In this paper we give a short introduction to logic programming approach to knowledge representation and reasoning. The intention is to help the reader to...
Article included in a special issue devoted to the theme: Knowledge presentation and logic programming. Presents a short introduction to the logic programming...
SourceID proquest
crossref
elsevier
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 3
SubjectTerms Answer set programming
Artificial intelligence
Default reasoning
Knowledge representation
Logic programming
Nonmonotonic reasoning
Title Logic programming and knowledge representation—The A-Prolog perspective
URI https://dx.doi.org/10.1016/S0004-3702(02)00207-2
https://www.proquest.com/docview/57519303
Volume 138
WOSCitedRecordID wos000176430000002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: ScienceDirect database
  customDbUrl:
  eissn: 1872-7921
  dateEnd: 20180131
  omitProxy: false
  ssIdentifier: ssj0003991
  issn: 0004-3702
  databaseCode: AIEXJ
  dateStart: 19950101
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1PaxQxFA_SevCi1VqsWs3BQ0sZDZPMJDmW0mI9lIIt7C0kmQwIdbrsbkuPfgg_oZ_El38zs12kVRCWsAzJBPJ-8_LLy_uD0IdW1lpyx4raaVIwLXywsisLUxEDBLttNIvFJvjpqZhM5Fm6aJ-HcgK868TtrZz-V1HDMxC2D539C3H3L4UH8B-EDi2IHdoHCd5XT7bZ7-p7jkHsbWf7IY1lDjnqsrMDC9WZi7NZKE05XQ7BHNLUBs-iUOdjlMqz9-Fxl22uUjzyxg_uPlfRchqAp5dMDeXgEhXtXysxMEmnMlBTJOpUF9Wo4MDbZYx97vUsFSuAilqTjrbf2GlFsUcbw9d-MqDfvpGe7vIUQLmcNzv09V1JGTrBPr1e8kqC6ls_ODmafOk3bOBoqbBifPcQ6PVpmHCXlHtpsj9RmDubeWAo5xvoaTpa4IMIiefoketeoGe5bAdOWnwTnQSE4BFCMCAE9wjBywj59eMnYANnbOARNl6ii-Oj88PPRaqoUVhKxaIQLdeSGlZrAQdjTho4jpu2Mg2oZQPqWTSOmUrXwPpJ45MNmNLKChhlK3kjy5puobUOAPMKYSu89VwIw5ll2lLtgOmIhhLLqdFEbyOWF0nZlG7eVz25VINfIayt8mur_M-vrSq30cd-2DTmW7lvgMgSUIk0RjKoADr3DX2fJaZAqfqbMt25q-u58peREsjd639_-Rv0ZPiE3qK1xeza7aDH9mbxbT57lyD4G6F3lWU
linkProvider Elsevier
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Logic+programming+and+knowledge+representation%E2%80%94The+A-Prolog+perspective&rft.jtitle=Artificial+intelligence&rft.au=Gelfond%2C+Michael&rft.au=Leone%2C+Nicola&rft.date=2002-06-01&rft.pub=Elsevier+B.V&rft.issn=0004-3702&rft.eissn=1872-7921&rft.volume=138&rft.issue=1&rft.spage=3&rft.epage=38&rft_id=info:doi/10.1016%2FS0004-3702%2802%2900207-2&rft.externalDocID=S0004370202002072
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0004-3702&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0004-3702&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0004-3702&client=summon