Minimal founded semantics for disjunctive logic programs and deductive databases

In this paper, we propose a variant of stable model semantics for disjunctive logic programming and deductive databases. The semantics, called minimal founded, generalizes stable model semantics for normal (i.e. non-disjunctive) programs, but differs from disjunctive stable model semantics (the exte...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Theory and practice of logic programming Ročník 4; číslo 1-2; s. 75 - 93
Hlavní autori: FURFARO, FILIPPO, GRECO, GIANLUIGI, GRECO, SERGIO
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Cambridge, UK Cambridge University Press 01.01.2004
Predmet:
Regular Papers
Semantics
ISSN:1471-0684, 1475-3081
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 propose a variant of stable model semantics for disjunctive logic programming and deductive databases. The semantics, called minimal founded, generalizes stable model semantics for normal (i.e. non-disjunctive) programs, but differs from disjunctive stable model semantics (the extension of stable model semantics for disjunctive programs). Compared with disjunctive stable model semantics, minimal founded semantics seems to be more intuitive, it gives meaning to programs which are meaningless under stable model semantics and is no harder to compute. More specifically, minimal founded semantics differs from stable model semantics only for disjunctive programs having constraint rules or rules working as constraints. We study the expressive power of the semantics, and show that for general disjunctive datalog programs it has the same power as disjunctive stable model semantics.
AbstractList In this paper, we propose a variant of stable model semantics for disjunctive logic programming and deductive databases. The semantics, called minimal founded, generalizes stable model semantics for normal (i.e. non-disjunctive) programs, but differs from disjunctive stable model semantics (the extension of stable model semantics for disjunctive programs). Compared with disjunctive stable model semantics, minimal founded semantics seems to be more intuitive, it gives meaning to programs which are meaningless under stable model semantics and is no harder to compute. More specifically, minimal founded semantics differs from stable model semantics only for disjunctive programs having constraint rules or rules working as constraints. We study the expressive power of the semantics, and show that for general disjunctive datalog programs it has the same power as disjunctive stable model semantics.
In this paper, we propose a variant of stable model semantics for disjunctive logic programming and deductive databases. The semantics, called minimal founded , generalizes stable model semantics for normal (i.e. non-disjunctive) programs, but differs from disjunctive stable model semantics (the extension of stable model semantics for disjunctive programs). Compared with disjunctive stable model semantics, minimal founded semantics seems to be more intuitive, it gives meaning to programs which are meaningless under stable model semantics and is no harder to compute. More specifically, minimal founded semantics differs from stable model semantics only for disjunctive programs having constraint rules or rules working as constraints. We study the expressive power of the semantics, and show that for general disjunctive datalog programs it has the same power as disjunctive stable model semantics.
In this paper, we propose a variant of stable model semantics for disjunctive logic programming and deductive databases. The semantics, called minimal founded, generalizes stable model semantics for normal (i.e. non-disjunctive) programs, but differs from disjunctive stable model semantics (the extension of stable model semantics for disjunctive programs). Compared with disjunctive stable model semantics, minimal founded semantics seems to be more intuitive, it gives meaning to programs which are meaningless under stable model semantics and is no harder to compute. More specifically, minimal founded semantics differs from stable model semantics only for disjunctive programs having constraint rules or rules working as constraints. We study the expressive power of the semantics, and show that for general disjunctive datalog programs it has the same power as disjunctive stable model semantics. [PUBLICATION ABSTRACT]
Author FURFARO, FILIPPO
GRECO, GIANLUIGI
GRECO, SERGIO
Author_xml – sequence: 1
  givenname: FILIPPO
  surname: FURFARO
  fullname: FURFARO, FILIPPO
  email: filippo.furfaro@deis.unical.it
  organization: DEIS, Università della Calabria, 87030 Rende, Italy (e-mail: filippo.furfaro@deis.unical.it)
– sequence: 2
  givenname: GIANLUIGI
  surname: GRECO
  fullname: GRECO, GIANLUIGI
  email: gianluigi.greco@deis.unical.it
  organization: DEIS, Università della Calabria, 87030 Rende, Italy (e-mail: gianluigi.greco@deis.unical.it)
– sequence: 3
  givenname: SERGIO
  surname: GRECO
  fullname: GRECO, SERGIO
  email: greco@deis.unical.it
  organization: DEIS, Università della Calabria, 87030 Rende, Italy (e-mail: greco@deis.unical.it)
BookMark eNp9kFtLwzAUx4NMcJt-AN-K79VzkrRpH2V4g4mC-lzSJB0ZXTqTVPDbmzlBUPTp3P6_c5uRiRucIeQU4RwBxcUTcoFQVhwYpBj4AZmmVJEzqHDy6WO-qx-RWQjrpCkZ5VPyeG-d3cg-64bRaaOzYDbSRatCyvhM27AenYr2zWT9sLIq2_ph5eUmZNLpLAHjvqhllK0MJhyTw072wZx82Tl5ub56Xtzmy4ebu8XlMlcMecyFlrRQuoJW0RaKujAoQSKWwAS0VHUAjAvKhcG6gNoARVGImra8UmVrFJuTs33ftNDraEJs1sPoXRrZ0HRcXRWcJhHuRcoPIXjTNVufrvXvDUKz-1vz62-JET8YZaOMdnDRS9v_S7IvUm5ab_XKfO_0N_UBEk6BZg
CitedBy_id crossref_primary_10_1145_3143804
ContentType Journal Article
Copyright 2004 Cambridge University Press
2004 Cambridge University Press
Copyright_xml – notice: 2004 Cambridge University Press
– notice: 2004 Cambridge University Press
DBID AAYXX
CITATION
3V.
7SC
7XB
8AL
8FD
8FE
8FG
8FK
ABUWG
AFKRA
ARAPS
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
GNUQQ
HCIFZ
JQ2
K7-
L7M
L~C
L~D
M0N
P5Z
P62
PHGZM
PHGZT
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
Q9U
DOI 10.1017/S1471068403001704
DatabaseName CrossRef
ProQuest Central (Corporate)
Computer and Information Systems Abstracts
ProQuest Central (purchase pre-March 2016)
Computing Database (Alumni Edition)
Technology Research Database
ProQuest SciTech Collection
ProQuest Technology Collection
ProQuest Central (Alumni) (purchase pre-March 2016)
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
Advanced Technologies & Computer Science Collection
ProQuest Central Essentials
ProQuest Central
Technology Collection
ProQuest One
ProQuest Central Korea
ProQuest Central Student
SciTech Premium Collection
ProQuest Computer Science Collection
Computer Science Database
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
Computing Database
Advanced Technologies & Aerospace Database
ProQuest Advanced Technologies & Aerospace Collection
Proquest Central Premium
ProQuest One Academic (New)
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
ProQuest Central Basic
DatabaseTitle CrossRef
Computer Science Database
ProQuest Central Student
Technology Collection
Technology Research Database
Computer and Information Systems Abstracts – Academic
ProQuest One Academic Middle East (New)
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
ProQuest Central (Alumni Edition)
SciTech Premium Collection
ProQuest One Community College
ProQuest Central China
ProQuest Central
ProQuest One Applied & Life Sciences
ProQuest Central Korea
ProQuest Central (New)
Advanced Technologies Database with Aerospace
Advanced Technologies & Aerospace Collection
ProQuest Computing
ProQuest Central Basic
ProQuest Computing (Alumni Edition)
ProQuest One Academic Eastern Edition
ProQuest Technology Collection
ProQuest SciTech Collection
Computer and Information Systems Abstracts Professional
Advanced Technologies & Aerospace Database
ProQuest One Academic UKI Edition
ProQuest One Academic
ProQuest Central (Alumni)
ProQuest One Academic (New)
DatabaseTitleList
CrossRef
Computer Science Database
Database_xml – sequence: 1
  dbid: BENPR
  name: ProQuest Central
  url: https://www.proquest.com/central
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1475-3081
EndPage 93
ExternalDocumentID 1403174811
10_1017_S1471068403001704
Genre Feature
GroupedDBID -E.
.FH
09C
09E
0E1
0R~
123
29Q
3V.
4.4
5VS
74X
74Y
7~V
8FE
8FG
8R4
8R5
AAAZR
AABES
AABWE
AACJH
AAFUK
AAGFV
AAKTX
AANRG
AARAB
AASVR
AAUKB
AAYOK
ABBXD
ABITZ
ABJNI
ABKKG
ABMWE
ABQTM
ABQWD
ABROB
ABTCQ
ABUWG
ABVKB
ABVZP
ABZCX
ACAJB
ACBMC
ACDLN
ACGFS
ACIMK
ACNCT
ACUIJ
ACYZP
ACZBM
ACZUX
ACZWT
ADCGK
ADDNB
ADFEC
ADKIL
ADOVH
ADVJH
AEBAK
AEHGV
AEMTW
AENEX
AENGE
AEYYC
AFFUJ
AFKQG
AFKRA
AFLOS
AFLVW
AFUTZ
AFZFC
AGABE
AGBYD
AGJUD
AHQXX
AHRGI
AIGNW
AIHIV
AIOIP
AISIE
AJ7
AJCYY
AJPFC
AJQAS
ALMA_UNASSIGNED_HOLDINGS
ALVPG
ALWZO
AQJOH
ARABE
ARAPS
ATUCA
AUXHV
AZQEC
BBLKV
BENPR
BGHMG
BGLVJ
BLZWO
BMAJL
BPHCQ
C0O
CAG
CBIIA
CCPQU
CCQAD
CCTKK
CFAFE
CHEAL
CJCSC
COF
CS3
DC4
DOHLZ
DU5
DWQXO
EBS
EJD
GNUQQ
HCIFZ
HG-
HST
HZ~
I.6
IH6
IOEEP
IS6
I~P
J36
J38
J3A
J9A
JHPGK
JQKCU
K6V
K7-
KCGVB
KFECR
L98
LW7
M-V
M0N
NIKVX
O9-
OK1
OYBOY
P2P
P62
PQQKQ
PROAC
PYCCK
Q2X
RAMDC
RCA
ROL
RR0
S6-
S6U
SAAAG
T9M
UT1
WFFJZ
WQ3
WXU
WYP
ZYDXJ
AAYXX
ABGDZ
ABXHF
AFFHD
AKMAY
CITATION
IPYYG
PHGZM
PHGZT
PQGLB
7SC
7XB
8AL
8FD
8FK
JQ2
L7M
L~C
L~D
PKEHL
PQEST
PQUKI
PRINS
Q9U
ID FETCH-LOGICAL-c314t-7da25cd80bc2b0595e1a0a1160370b2cf00347247e19509e02175792b48c6bec3
IEDL.DBID K7-
ISICitedReferencesCount 4
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000189118100003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1471-0684
IngestDate Fri Jul 25 08:02:43 EDT 2025
Tue Nov 18 22:14:26 EST 2025
Sat Nov 29 07:49:45 EST 2025
Tue Jan 21 06:17:03 EST 2025
IsPeerReviewed true
IsScholarly true
Issue 1-2
Language English
License https://www.cambridge.org/core/terms
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c314t-7da25cd80bc2b0595e1a0a1160370b2cf00347247e19509e02175792b48c6bec3
Notes SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
PQID 201698542
PQPubID 43613
PageCount 19
ParticipantIDs proquest_journals_201698542
crossref_primary_10_1017_S1471068403001704
crossref_citationtrail_10_1017_S1471068403001704
cambridge_journals_10_1017_S1471068403001704
PublicationCentury 2000
PublicationDate 20040100
2004-01-00
20040101
PublicationDateYYYYMMDD 2004-01-01
PublicationDate_xml – month: 1
  year: 2004
  text: 20040100
PublicationDecade 2000
PublicationPlace Cambridge, UK
PublicationPlace_xml – name: Cambridge, UK
– name: Cambridge
PublicationTitle Theory and practice of logic programming
PublicationTitleAlternate Theory and Practice of Logic Programming
PublicationYear 2004
Publisher Cambridge University Press
Publisher_xml – name: Cambridge University Press
SSID ssj0016324
Score 1.6166953
Snippet In this paper, we propose a variant of stable model semantics for disjunctive logic programming and deductive databases. The semantics, called minimal founded,...
In this paper, we propose a variant of stable model semantics for disjunctive logic programming and deductive databases. The semantics, called minimal founded...
In this paper, we propose a variant of stable model semantics for disjunctive logic programming and deductive databases. The semantics, called minimal founded,...
SourceID proquest
crossref
cambridge
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 75
SubjectTerms Regular Papers
Semantics
Title Minimal founded semantics for disjunctive logic programs and deductive databases
URI https://www.cambridge.org/core/product/identifier/S1471068403001704/type/journal_article
https://www.proquest.com/docview/201698542
Volume 4
WOSCitedRecordID wos000189118100003&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: PRVPQU
  databaseName: Advanced Technologies & Aerospace Database
  customDbUrl:
  eissn: 1475-3081
  dateEnd: 20241214
  omitProxy: false
  ssIdentifier: ssj0016324
  issn: 1471-0684
  databaseCode: P5Z
  dateStart: 20010101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/hightechjournals
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Computer Science Database
  customDbUrl:
  eissn: 1475-3081
  dateEnd: 20241214
  omitProxy: false
  ssIdentifier: ssj0016324
  issn: 1471-0684
  databaseCode: K7-
  dateStart: 20010101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/compscijour
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 1475-3081
  dateEnd: 20241214
  omitProxy: false
  ssIdentifier: ssj0016324
  issn: 1471-0684
  databaseCode: BENPR
  dateStart: 20010101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3NS8MwFA-6efDi_MQ5HTl4EgP9SJv0JCobXhxFFIaX0nwUKq6b6_TvN69Nq0PYxUsO-YCQ9_Jekvfy-yF0yUKRRqlPSeZmnNAg00RIqojDtfR9mRm3IiqyCTaZ8Ok0im1uTmnTKhubWBlqNZfwRm4u6W4Y8YB6N4sPAqRREFy1DBrbqOt6xgZDTJaRNogASOTV5yIGyT2cNkFNQIyGSqgzOg4IMvQ3tMK6i1q30JXbGff-OeF9tGfPm_i2VpADtKWLQ9RruByw3dpHKH7Mi3xmembAs6QVLvXMLHouS1OzxCov34wHBNuIK2uJbWJXidNCYQUAsFUjZJyCZyyP0ct49Hz_QCzbApG-S1eEqdQDpABHSE-YQ1eg3dRJXaChZo7wjNgcnzKPMg3MsZGGy0zAIk9QLkOjCf4J6hTzQp8iDJ9hJfM9JdOMMi45k0qaHlxkTiRU2EfX7WInds-USZ1vxpI_sukjp5FHIi1yORBovG8actUOWdSwHZs6DxoJ_symFd_ZxtYB2q1zeeBR5hx1VstPfYF25NcqL5dD1L0bTeKnYaWXpoyD12-gUOXV
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1JS8QwFH64gV7cxd0c9CIW2jSdpAcRcUFxZpjDCOKlNkuholWno-KP8j-a12V0EObmwWuWkjQv70vylg9glzdkHMY-cxIvEQ4LEuNIxbTjCqN8XyUWVmRBNsHbbXFzE3bG4LOOhUG3ylonFopaPyl8I7eXdK8RioDRo-cXB0mj0LhaM2iUUnFlPt7tjS0_vDy1y7tH6flZ9-TCqUgFHOV7rO9wHVMMiHelotKeLQLjxW7sIdsydyW1o3N9xinjBglSQ4Nn9oCHVDKhGnbCvv3uOEwyRl0kTOgEtwOjBWY-L4KZODoTCVYbUTFDNRZimd1TmLGG_UzlMAyJw4hQwNz53D_7QfMwW52nyXG5ARZgzGSLMFdzVZBKdS1Bp5Vm6aNtmSCPlNEkN49WqFKV25Ie0Wl-bxEedT8p0IBUjms5iTNNNCa4LSrRoxaRP1-G6z-Z1wpMZE-ZWQWCwb6K-1SrOGFcKMGVVraFkIkbSt1Yg4PB4kaVTsij0p-OR79kYQ3cev0jVWVmR4KQh1Fd9gddnsu0JKMab9QS8z2agbisj6zdgemLbqsZNS_bVxswU_ot4QPUJkz0e69mC6bUWz_Ne9vFXiBw99ey9QXVtj2Y
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=Minimal+founded+semantics+for+disjunctive+logic+programs+and+deductive+databases&rft.jtitle=Theory+and+practice+of+logic+programming&rft.au=FURFARO%2C+FILIPPO&rft.au=GRECO%2C+GIANLUIGI&rft.au=GRECO%2C+SERGIO&rft.date=2004-01-01&rft.issn=1471-0684&rft.eissn=1475-3081&rft.volume=4&rft.issue=1-2&rft.spage=75&rft.epage=93&rft_id=info:doi/10.1017%2FS1471068403001704&rft.externalDBID=n%2Fa&rft.externalDocID=10_1017_S1471068403001704
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1471-0684&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1471-0684&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1471-0684&client=summon