A necessary condition for Constructive Negation in Constraint Logic Programming

Stuckey (1995) has presented a sound and complete procedure for Constructive Negation in Constraint Logic Programming, together with a sufficient condition, called admissible closure, which guarantees an effective implementation. In this paper we analyze this condition and relate it to the decidabil...

Full description

Saved in:

Bibliographic Details
Published in:	Information processing letters Vol. 74; no. 3; pp. 147 - 156
Main Authors:	Dovier, Agostino, Pontelli, Enrico, Rossi, Gianfranco
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 31.05.2000 Elsevier Sequoia S.A
Subjects:	Automatic theorem proving Computer programming Constraint Logic Programming Formal semantics Logic Logic programming Negation Programming languages Studies Negation Automatic theorem proving Programming languages Formal semantics Constraint Logic Programming
ISSN:	0020-0190, 1872-6119
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Abstract	Stuckey (1995) has presented a sound and complete procedure for Constructive Negation in Constraint Logic Programming, together with a sufficient condition, called admissible closure, which guarantees an effective implementation. In this paper we analyze this condition and relate it to the decidability of the underlying constraint structure. We prove that the admissible closure condition is also necessary to guarantee the existence of an effective implementation of Constructive Negation.
AbstractList	Stuckey (1995) has presented a sound and complete procedure for Constructive Negation in Constraint Logic Programming, together with a sufficient condition, called admissible closure, which guarantees an effective implementation. This condition is analyzed and related to the decidability of the underlying constraint structure. It is proven that the admissible closure condition is also necessary to guarantee the existence of an effective implementation of Constructive Negation. Stuckey (1995) has presented a sound and complete procedure for Constructive Negation in Constraint Logic Programming, together with a sufficient condition, called admissible closure, which guarantees an effective implementation. In this paper we analyze this condition and relate it to the decidability of the underlying constraint structure. We prove that the admissible closure condition is also necessary to guarantee the existence of an effective implementation of Constructive Negation. Stuckey (1995) has presented a sound and complete procedure for Constructive Negation in Constraint Logic Programming, together with a sufficient condition, called admissible closure, which guarantees an effective implementation. In this paper we analyze this condition and relate it to the decidability of the underlying constraint structure. We prove that the admissible closure condition is also necessary to guarantee the existence of an effective implementation of Constructive Negation.
Author	Rossi, Gianfranco Pontelli, Enrico Dovier, Agostino
Author_xml	– sequence: 1 givenname: Agostino surname: Dovier fullname: Dovier, Agostino email: dovier@sci.univr.it organization: Università di Verona, Dip. Scientifico-Tecnologico, Strada Le Grazie. 37134 Verona, Italy – sequence: 2 givenname: Enrico surname: Pontelli fullname: Pontelli, Enrico email: epontell@cs.nmsu.edu organization: New Mexico State University, Department Computer Science, Las Cruces, NM 88003, USA – sequence: 3 givenname: Gianfranco surname: Rossi fullname: Rossi, Gianfranco email: gianfr@prmat.math.unipr.it organization: Università di Parma, Dip. di Matematica, Via M. D'Azeglio, 85/A. 43100 Parma, Italy
BookMark	eNqFkE1Lw0AQhhepYFv9CULwIHqIzibZbIMHKcUvKFZQz8t2Mxu2tLt1Nyn4703a4qGXwsAc5nlfhmdAetZZJOSSwh0Fmt9_AiQQAy3gBuAWALI8zk9In454EueUFj3S_0fOyCCERQvlWcr7ZDaOLCoMQfrfSDlbmto4G2nno4mzofaNqs0Go3es5PZi7P4gja2jqauMij68q7xcrYytzsmplsuAF_s9JN_PT1-T13g6e3mbjKexSnNWx1xpVijOca5LhpRiyeSIZsAQ1Rx1nlKuGZVcSygk50k2T5EWCaQjxrTMMB2S613v2rufBkMtViYoXC6lRdcEkXBWMM6SFrw6ABeu8bb9TSQpT0ZQUNZCbAcp70LwqMXam1WrRFAQnWOxdSw6gQK6aR2LvM09HOSUqbeeOj_Lo-nHXRpbURuDXgRl0CosjUdVi9KZIw1_qV-Xtg
CODEN	IFPLAT
CitedBy_id	crossref_primary_10_1017_S1471068417000199 crossref_primary_10_1145_365151_365169 crossref_primary_10_1007_s00354_008_0053_9 crossref_primary_10_1017_S1471068421000156
Cites_doi	10.1016/0743-1066(94)90033-7 10.1016/S0743-1066(96)00092-1 10.3233/FI-1998-36235 10.1007/BF01185404 10.1016/S0743-1066(98)10002-X 10.1006/inco.1995.1048 10.1016/0743-1066(94)90024-8 10.1016/0743-1066(84)90011-6 10.1016/0743-1066(95)00147-6 10.1016/0743-1066(90)90023-X
ContentType	Journal Article
Copyright	2000 Elsevier Science B.V. Copyright Elsevier Sequoia S.A. May 31, 2000
Copyright_xml	– notice: 2000 Elsevier Science B.V. – notice: Copyright Elsevier Sequoia S.A. May 31, 2000
DBID	AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D
DOI	10.1016/S0020-0190(00)00046-6
DatabaseName	CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional
DatabaseTitle	CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional
DatabaseTitleList	Computer and Information Systems Abstracts Computer and Information Systems Abstracts
DeliveryMethod	fulltext_linktorsrc
Discipline	Computer Science
EISSN	1872-6119
EndPage	156
ExternalDocumentID	54458414 10_1016_S0020_0190_00_00046_6 S0020019000000466
Genre	Feature
GroupedDBID	--K --M -~X .DC .~1 0R~ 1B1 1RT 1~. 1~5 29I 4.4 457 4G. 5GY 5VS 7-5 71M 8P~ 9JN AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN ABBOA ABEFU ABFNM ABFSI ABJNI ABMAC ABTAH ABXDB ABYKQ ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADJOM ADMUD AEBSH AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ASPBG AVWKF AXJTR AZFZN BKOJK BKOMP BLXMC CS3 DU5 E.L EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q G8K GBLVA GBOLZ HLZ HMJ HVGLF HZ~ IHE J1W KOM LG9 M26 M41 MO0 MS~ O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 R2- RIG ROL RPZ SBC SDF SDG SDP SES SEW SME SPC SPCBC SSV SSZ T5K TN5 UQL WH7 WUQ XPP ZMT ZY4 ~G- 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD 7SC 8FD AFXIZ AGCQF AGRNS JQ2 L7M L~C L~D SSH
ID	FETCH-LOGICAL-c365t-7cf59c77ebfd5e11ed5a81405eecbef6317f51a7fa09a7724b3e19203855fa4e3
ISICitedReferencesCount	8
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000087230500009&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0020-0190
IngestDate	Sat Sep 27 17:51:03 EDT 2025 Fri Jul 25 03:54:10 EDT 2025 Tue Nov 18 21:54:04 EST 2025 Sat Nov 29 02:29:43 EST 2025 Fri Feb 23 02:28:02 EST 2024
IsPeerReviewed	true
IsScholarly	true
Issue	3
Keywords	Negation Automatic theorem proving Programming languages Formal semantics Constraint Logic Programming
Language	English
License	https://www.elsevier.com/tdm/userlicense/1.0
LinkModel	OpenURL
MergedId	FETCHMERGED-LOGICAL-c365t-7cf59c77ebfd5e11ed5a81405eecbef6317f51a7fa09a7724b3e19203855fa4e3
Notes	SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-2 content type line 23
PQID	237280915
PQPubID	45522
PageCount	10
ParticipantIDs	proquest_miscellaneous_27595752 proquest_journals_237280915 crossref_primary_10_1016_S0020_0190_00_00046_6 crossref_citationtrail_10_1016_S0020_0190_00_00046_6 elsevier_sciencedirect_doi_10_1016_S0020_0190_00_00046_6
PublicationCentury	2000
PublicationDate	2000-05-31
PublicationDateYYYYMMDD	2000-05-31
PublicationDate_xml	– month: 05 year: 2000 text: 2000-05-31 day: 31
PublicationDecade	2000
PublicationPlace	Amsterdam
PublicationPlace_xml	– name: Amsterdam
PublicationTitle	Information processing letters
PublicationYear	2000
Publisher	Elsevier B.V Elsevier Sequoia S.A
Publisher_xml	– name: Elsevier B.V – name: Elsevier Sequoia S.A
References	Chan (ID009) 1988 Barbuti, Mancarella, Pedreschi, Turini (ID008) 1990; Vol. 8 Jaffar, Maher (ID015) 1994; Vol. 19–20 Drabent (ID012) 1995; Vol. 32 Fages (ID014) 1997; Vol. 32 Dovier, Omodeo, Pontelli, Rossi (ID010) 1996; Vol. 28 Jaffar, Maher, Marriott, Stuckey (ID016) 1998; Vol. 37 Dovier, Policriti, Rossi (ID011) 1998; Vol. 36 Vaught (ID022) 1962 Lloyd, Topor (ID017) 1984; Vol. 1 Enderton (ID013) 1973 Przymusinski (ID019) 1989 Shepherdson (ID020) 1988 Apt, Bol (ID007) 1994; Vol. 19–20 Maher (ID018) 1988 Stuckey (ID021) 1995; Vol. 1 Shepherdson (10.1016/S0020-0190(00)00046-6_ID020) 1988 Apt (10.1016/S0020-0190(00)00046-6_ID007) 1994; Vol. 19–20 Fages (10.1016/S0020-0190(00)00046-6_ID014) 1997; Vol. 32 Vaught (10.1016/S0020-0190(00)00046-6_ID022) 1962 Drabent (10.1016/S0020-0190(00)00046-6_ID012) 1995; Vol. 32 Barbuti (10.1016/S0020-0190(00)00046-6_ID008) 1990; Vol. 8 Przymusinski (10.1016/S0020-0190(00)00046-6_ID019) 1989 Lloyd (10.1016/S0020-0190(00)00046-6_ID017) 1984; Vol. 1 Chan (10.1016/S0020-0190(00)00046-6_ID009) 1988 Dovier (10.1016/S0020-0190(00)00046-6_ID011) 1998; Vol. 36 Enderton (10.1016/S0020-0190(00)00046-6_ID013) 1973 Dovier (10.1016/S0020-0190(00)00046-6_ID010) 1996; Vol. 28 Maher (10.1016/S0020-0190(00)00046-6_ID018) 1988 Jaffar (10.1016/S0020-0190(00)00046-6_ID015) 1994; Vol. 19–20 Jaffar (10.1016/S0020-0190(00)00046-6_ID016) 1998; Vol. 37 Stuckey (10.1016/S0020-0190(00)00046-6_ID021) 1995; Vol. 1
References_xml	– volume: Vol. 32 start-page: 27 year: 1995 end-page: 29 ident: ID012 article-title: What is failure? An approach to constructive negation publication-title: Acta Inform. – start-page: 349 year: 1988 end-page: 357 ident: ID018 article-title: Complete axiomatizations of the algebras of finite, rational and infinite trees publication-title: Proc. 3rd Symposium Logic in Computer Science, Edinburgh – start-page: 19 year: 1988 end-page: 88 ident: ID020 article-title: Negation in logic programming publication-title: Foundations of Deductive Databases and Logic Programming – volume: Vol. 37 start-page: 1 year: 1998 end-page: 46 ident: ID016 article-title: The semantics of constraint logic programs publication-title: J. Logic Programming – volume: Vol. 8 start-page: 201 year: 1990 end-page: 228 ident: ID008 article-title: A transformation approach to negation in logic programming publication-title: J. Logic Programming – start-page: 14 year: 1962 end-page: 25 ident: ID022 article-title: On a theorem of Cobham concerning undecidable theories publication-title: Proc. 1960 International Congress – volume: Vol. 19–20 start-page: 503 year: 1994 end-page: 581 ident: ID015 article-title: Constraint logic programming: A survey publication-title: J. Logic Programming – volume: Vol. 32 start-page: 85 year: 1997 end-page: 118 ident: ID014 article-title: Constructive Negation by pruning publication-title: J. Logic Programming – volume: Vol. 19–20 start-page: 9 year: 1994 end-page: 71 ident: ID007 article-title: Logic programming and negation: A survey publication-title: J. Logic Programming – volume: Vol. 1 start-page: 225 year: 1984 end-page: 240 ident: ID017 article-title: Making Prolog more expressive publication-title: J. Logic Programming – year: 1973 ident: ID013 article-title: A Mathematical Introduction to Logic – start-page: 111 year: 1988 end-page: 125 ident: ID009 article-title: Constructive Negation based on the completed database publication-title: Logic Programming, Proc. 5th International Conference and Symposium – volume: Vol. 36 start-page: 201 year: 1998 end-page: 234 ident: ID011 article-title: A uniform axiomatic view of lists, multisets and sets, and the relevant unification algorithms publication-title: Fund. Inform. – volume: Vol. 28 start-page: 1 year: 1996 end-page: 44 ident: ID010 article-title: {log}: A language for programming in logic with finite sets publication-title: J. Logic Programming – year: 1989 ident: ID019 article-title: On constructive negation in logic programming publication-title: Logic Programming, Proceedings of the North American Conference 1989 – volume: Vol. 1 start-page: 12 year: 1995 end-page: 33 ident: ID021 article-title: Negation and constraint logic programming publication-title: Inform. and Comput. – volume: Vol. 19–20 start-page: 503 year: 1994 ident: 10.1016/S0020-0190(00)00046-6_ID015 article-title: Constraint logic programming: A survey publication-title: J. Logic Programming doi: 10.1016/0743-1066(94)90033-7 – volume: Vol. 32 start-page: 85 issue: 2 year: 1997 ident: 10.1016/S0020-0190(00)00046-6_ID014 article-title: Constructive Negation by pruning publication-title: J. Logic Programming doi: 10.1016/S0743-1066(96)00092-1 – volume: Vol. 36 start-page: 201 issue: 2/3 year: 1998 ident: 10.1016/S0020-0190(00)00046-6_ID011 article-title: A uniform axiomatic view of lists, multisets and sets, and the relevant unification algorithms publication-title: Fund. Inform. doi: 10.3233/FI-1998-36235 – volume: Vol. 32 start-page: 27 issue: 1 year: 1995 ident: 10.1016/S0020-0190(00)00046-6_ID012 article-title: What is failure? An approach to constructive negation publication-title: Acta Inform. doi: 10.1007/BF01185404 – start-page: 14 year: 1962 ident: 10.1016/S0020-0190(00)00046-6_ID022 article-title: On a theorem of Cobham concerning undecidable theories – start-page: 111 year: 1988 ident: 10.1016/S0020-0190(00)00046-6_ID009 article-title: Constructive Negation based on the completed database – start-page: 349 year: 1988 ident: 10.1016/S0020-0190(00)00046-6_ID018 article-title: Complete axiomatizations of the algebras of finite, rational and infinite trees – volume: Vol. 37 start-page: 1 year: 1998 ident: 10.1016/S0020-0190(00)00046-6_ID016 article-title: The semantics of constraint logic programs publication-title: J. Logic Programming doi: 10.1016/S0743-1066(98)10002-X – year: 1989 ident: 10.1016/S0020-0190(00)00046-6_ID019 article-title: On constructive negation in logic programming – volume: Vol. 1 start-page: 12 year: 1995 ident: 10.1016/S0020-0190(00)00046-6_ID021 article-title: Negation and constraint logic programming publication-title: Inform. and Comput. doi: 10.1006/inco.1995.1048 – volume: Vol. 19–20 start-page: 9 year: 1994 ident: 10.1016/S0020-0190(00)00046-6_ID007 article-title: Logic programming and negation: A survey publication-title: J. Logic Programming doi: 10.1016/0743-1066(94)90024-8 – volume: Vol. 1 start-page: 225 issue: 3 year: 1984 ident: 10.1016/S0020-0190(00)00046-6_ID017 article-title: Making Prolog more expressive publication-title: J. Logic Programming doi: 10.1016/0743-1066(84)90011-6 – start-page: 19 year: 1988 ident: 10.1016/S0020-0190(00)00046-6_ID020 article-title: Negation in logic programming – volume: Vol. 28 start-page: 1 issue: 1 year: 1996 ident: 10.1016/S0020-0190(00)00046-6_ID010 article-title: {log}: A language for programming in logic with finite sets publication-title: J. Logic Programming doi: 10.1016/0743-1066(95)00147-6 – volume: Vol. 8 start-page: 201 year: 1990 ident: 10.1016/S0020-0190(00)00046-6_ID008 article-title: A transformation approach to negation in logic programming publication-title: J. Logic Programming doi: 10.1016/0743-1066(90)90023-X – year: 1973 ident: 10.1016/S0020-0190(00)00046-6_ID013
SSID	ssj0006437
Score	1.5947443
Snippet	Stuckey (1995) has presented a sound and complete procedure for Constructive Negation in Constraint Logic Programming, together with a sufficient condition,...
SourceID	proquest crossref elsevier
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	147
SubjectTerms	Automatic theorem proving Computer programming Constraint Logic Programming Formal semantics Logic Logic programming Negation Programming languages Studies
Title	A necessary condition for Constructive Negation in Constraint Logic Programming
URI	https://dx.doi.org/10.1016/S0020-0190(00)00046-6 https://www.proquest.com/docview/237280915 https://www.proquest.com/docview/27595752
Volume	74
WOSCitedRecordID	wos000087230500009&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: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1872-6119 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0006437 issn: 0020-0190 databaseCode: AIEXJ dateStart: 19950113 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9QwELaWLQcu5S22LeADB1CVksRxnBxXVXkdCoIi7S1yHKdatHVW7bLqb-BXMxM_srRCBSSklbXyI448X2Y89jwIeQGqP2c1qCVJU7Mokw2PZAGFSps0rUXeZrFNNiGOj4vZrPw0Gv3wvjDrhTCmuLwsl_-V1FAHxEbX2b8gd3goVMB_IDqUQHYo_4jw032j0fYfzeFA2W3mwZoQk3PacLFrNGw8ld7Q0TbIuVlhCl80lrdWW2dern3z9u7B13F_aT0M8KRh0bsEDRnqO5S1PdM57YCDmC7w384GAO0ZsAEOHFo-g6zuq98CXFtM9tH9ch4RrtL9Idk1RxnnNID2bzYz6IG2vLYQKWiujmM6ZmxT9jjQsQ3OmtjAnE5IJzYa-TX-b48ivoTpYJeOya7L3kk2uhJzu5fifV_satWlPL9FtlLBy2JMtqbvj2YfglzHK05rMGSfPfiDvR4mfBnHr9xkv9vpXJH5_Ubm5B7ZdhoInVrk3CcjbR6Quz67B3XM_iH5OKUBSDQAiQIC6CaQqAcSnRs6AIn2QKIbQHpEvr45Ojl8F7n0G5FiOV9FQrW8VELoum24ThLdcInx0bjWqtZtDjvPlidStDIuJShpWc006At41cxbmWn2mIxNZ_QTQmWiSy5irmqGCr2Wddo2dSZVoRRrpJyQzC9VpVxsenzbRTUYIcIKV7jCVYw_WOEqn5CDMGxpg7PcNKDwdKjcDtPuHCsA0E1Ddz3dKve1X1Qpw-xuZcIn5HloBf6Ml27S6O47dAEsgUqU7vz71LvkzvCh7ZExEFg_JbfVejW_OH_mYPoTXk2yDg
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=A+necessary+condition+for+Constructive+Negation+in+Constraint+Logic+Programming&rft.jtitle=Information+processing+letters&rft.au=Dovier%2C+Agostino&rft.au=Pontelli%2C+Enrico&rft.au=Rossi%2C+Gianfranco&rft.date=2000-05-31&rft.pub=Elsevier+B.V&rft.issn=0020-0190&rft.eissn=1872-6119&rft.volume=74&rft.issue=3&rft.spage=147&rft.epage=156&rft_id=info:doi/10.1016%2FS0020-0190%2800%2900046-6&rft.externalDocID=S0020019000000466
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0020-0190&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0020-0190&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0020-0190&client=summon