Stable-unstable semantics: Beyond NP with normal logic programs
Standard answer set programming (ASP) targets at solving search problems from the first level of the polynomial time hierarchy (PH). Tackling search problems beyond NP using ASP is less straightforward. The class of disjunctive logic programs offers the most prominent way of reaching the second leve...
Saved in:
| Published in: | Theory and practice of logic programming Vol. 16; no. 5-6; pp. 570 - 586 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Cambridge, UK
Cambridge University Press
01.09.2016
|
| Subjects: | |
| ISSN: | 1471-0684, 1475-3081 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | Standard answer set programming (ASP) targets at solving search problems from the first level of the polynomial time hierarchy (PH). Tackling search problems beyond NP using ASP is less straightforward. The class of disjunctive logic programs offers the most prominent way of reaching the second level of the PH, but encoding respective hard problems as disjunctive programs typically requires sophisticated techniques such as saturation or meta-interpretation. The application of such techniques easily leads to encodings that are inaccessible to non-experts. Furthermore, while disjunctive ASP solvers often rely on calls to a (co-)NP oracle, it may be difficult to detect from the input program where the oracle is being accessed. In other formalisms, such as Quantified Boolean Formulas (QBFs), the interface to the underlying oracle is more transparent as it is explicitly recorded in the quantifier prefix of a formula. On the other hand, ASP has advantages over QBFs from the modeling perspective. The rich high-level languages such as ASP-Core-2 offer a wide variety of primitives that enable concise and natural encodings of search problems. In this paper, we present a novel logic programming–based modeling paradigm that combines the best features of ASP and QBFs. We develop so-called combined logic programs in which oracles are directly cast as (normal) logic programs themselves. Recursive incarnations of this construction enable logic programming on arbitrarily high levels of the PH. We develop a proof-of-concept implementation for our new paradigm. |
|---|---|
| AbstractList | Standard answer set programming (ASP) targets at solving search problems from the first level of the polynomial time hierarchy (PH). Tackling search problems beyond NP using ASP is less straightforward. The class of disjunctive logic programs offers the most prominent way of reaching the second level of the PH, but encoding respective hard problems as disjunctive programs typically requires sophisticated techniques such as saturation or meta-interpretation. The application of such techniques easily leads to encodings that are inaccessible to non-experts. Furthermore, while disjunctive ASP solvers often rely on calls to a (co-)NP oracle, it may be difficult to detect from the input program where the oracle is being accessed. In other formalisms, such as Quantified Boolean Formulas (QBFs), the interface to the underlying oracle is more transparent as it is explicitly recorded in the quantifier prefix of a formula. On the other hand, ASP has advantages over QBFs from the modeling perspective. The rich high-level languages such as ASP-Core-2 offer a wide variety of primitives that enable concise and natural encodings of search problems. In this paper, we present a novel logic programming–based modeling paradigm that combines the best features of ASP and QBFs. We develop so-called
combined logic programs
in which oracles are directly cast as (normal) logic programs themselves. Recursive incarnations of this construction enable logic programming on arbitrarily high levels of the PH. We develop a proof-of-concept implementation for our new paradigm. Standard answer set programming (ASP) targets at solving search problems from the first level of the polynomial time hierarchy (PH). Tackling search problems beyond NP using ASP is less straightforward. The class of disjunctive logic programs offers the most prominent way of reaching the second level of the PH, but encoding respective hard problems as disjunctive programs typically requires sophisticated techniques such as saturation or meta-interpretation. The application of such techniques easily leads to encodings that are inaccessible to non-experts. Furthermore, while disjunctive ASP solvers often rely on calls to a (co-)NP oracle, it may be difficult to detect from the input program where the oracle is being accessed. In other formalisms, such as Quantified Boolean Formulas (QBFs), the interface to the underlying oracle is more transparent as it is explicitly recorded in the quantifier prefix of a formula. On the other hand, ASP has advantages over QBFs from the modeling perspective. The rich high-level languages such as ASP-Core-2 offer a wide variety of primitives that enable concise and natural encodings of search problems. In this paper, we present a novel logic programming–based modeling paradigm that combines the best features of ASP and QBFs. We develop so-called combined logic programs in which oracles are directly cast as (normal) logic programs themselves. Recursive incarnations of this construction enable logic programming on arbitrarily high levels of the PH. We develop a proof-of-concept implementation for our new paradigm. |
| Author | JANHUNEN, TOMI BOGAERTS, BART TASHARROFI, SHAHAB |
| Author_xml | – sequence: 1 givenname: BART surname: BOGAERTS fullname: BOGAERTS, BART email: firstname.lastname@aalto.fi organization: Helsinki Institute for Information Technology HIIT Department of Computer Science, Aalto University, FI-00076 AALTO, Finland, (e-mail: firstname.lastname@aalto.fi) – sequence: 2 givenname: TOMI surname: JANHUNEN fullname: JANHUNEN, TOMI email: firstname.lastname@aalto.fi organization: Helsinki Institute for Information Technology HIIT Department of Computer Science, Aalto University, FI-00076 AALTO, Finland, (e-mail: firstname.lastname@aalto.fi) – sequence: 3 givenname: SHAHAB surname: TASHARROFI fullname: TASHARROFI, SHAHAB email: firstname.lastname@aalto.fi organization: Helsinki Institute for Information Technology HIIT Department of Computer Science, Aalto University, FI-00076 AALTO, Finland, (e-mail: firstname.lastname@aalto.fi) |
| BookMark | eNp9kEtLAzEQgINUsK3-AG8LXrys5rHZZL2IFl9QVKiel2w2W1N2k5pkkf5708dBKnqaYeb7ZoYZgYGxRgFwiuAFgohdzlDGEMx5hnIIIeHsAAxjiaYEcjTY5Chd94_AyPsFhCgnOBuC61kQVavS3vhNknjVCRO09FfJrVpZUyfPr8mXDh-Jsa4TbdLauZbJ0tm5E50_BoeNaL062cUxeL-_e5s8ptOXh6fJzTSVpCAhFQUVqKpwQ6BUvBBYNEpmDOeY1DmmijYMCUmIxBmvcYU5xAVXTdZQmSMVO2Nwvp0bF3_2yoey016qthVG2d6XiFNKcswoi-jZHrqwvTPxukhhzguCKIkU21LSWe-dakqpgwjamuCEbksEy_Vjy1-PjSbaM5dOd8Kt_nXIzhFd5XQ9Vz-O-tP6Bsscidk |
| CitedBy_id | crossref_primary_10_1007_s10703_021_00371_7 crossref_primary_10_1017_S1471068425100227 crossref_primary_10_1017_S1471068419000061 |
| Cites_doi | 10.1016/j.jcss.2011.05.004 10.1017/S1471068405002577 10.1017/S1471068415000150 10.1111/j.1755-2567.1966.tb00600.x 10.1007/s10817-007-9082-1 10.1016/j.artint.2015.09.008 10.1145/1149114.1149117 10.4064/fm-44-1-12-36 10.1017/S1471068414000155 10.1007/s11222-015-9611-4 10.1007/BF01530761 10.1007/978-3-642-60085-2_17 10.1142/S0218194096000053 10.1017/S147106841400009X 10.1145/1119439.1119440 10.1017/S1471068415000265 10.3233/FI-2010-357 10.1017/S1471068411000329 10.1007/BF03037169 10.1007/BF01536399 10.1023/A:1018930122475 |
| ContentType | Journal Article |
| Copyright | Copyright © Cambridge University Press 2016 |
| Copyright_xml | – notice: Copyright © Cambridge University Press 2016 |
| 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/S1471068416000387 |
| 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 ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection ProQuest Central Essentials ProQuest Central ProQuest Technology Collection ProQuest One ProQuest Central Korea ProQuest Central Student SciTech Premium Collection ProQuest Computer Science Collection Computer Science Database (ProQuest) 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 and Information Systems Abstracts 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 |
| DocumentTitleAlternate | Stable-unstable semantics: beyond NP with normal logic programs B. Bogaerts et al. |
| EISSN | 1475-3081 |
| EndPage | 586 |
| ExternalDocumentID | 4214925081 10_1017_S1471068416000387 |
| 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 AAEED AAFUK AAGFV AAKTX AANRG AARAB AASVR AAUKB AAYOK ABBXD ABITZ ABJNI ABKKG ABMWE ABMYL ABQTM ABQWD ABROB ABTCQ ABUWG ABZCX ACBMC ACCHT ACGFS ACIMK ACNCT ACQFJ ACREK ACUIJ ACUYZ ACWGA ACYZP ACZBM ACZUX ACZWT ADCGK ADDNB ADFEC ADGEJ ADKIL ADOCW ADOVH ADVJH AEBAK AEHGV AEMTW AENEX AENGE AEYYC AFFUJ AFKQG AFKRA AFKSM AFLOS AFLVW AFUTZ AGABE AGBYD AGJUD AGOOT 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 IPYYG 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 WXY WYP ZYDXJ AAYXX ABGDZ ABVKB ABVZP ABXHF ACAJB ACDLN AFFHD AFZFC AKMAY CITATION PHGZM PHGZT PQGLB 7SC 7XB 8AL 8FD 8FK JQ2 L7M L~C L~D PKEHL PQEST PQUKI PRINS Q9U PUEGO |
| ID | FETCH-LOGICAL-c393t-a95a1bb2f30ce89a2afec472623d625e5f71ac33c248d2b280298ef4f5c61eac3 |
| IEDL.DBID | K7- |
| ISICitedReferencesCount | 17 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000386589800005&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 Sep 05 06:59:19 EDT 2025 Fri Jul 25 10:02:32 EDT 2025 Sat Nov 29 04:58:36 EST 2025 Tue Nov 18 21:13:33 EST 2025 Wed Mar 13 05:56:09 EDT 2024 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 5-6 |
| Keywords | polynomial hierarchy quantified Boolean formulas disjunctive logic programming |
| Language | English |
| License | https://www.cambridge.org/core/terms |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c393t-a95a1bb2f30ce89a2afec472623d625e5f71ac33c248d2b280298ef4f5c61eac3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 content type line 23 |
| OpenAccessLink | https://www.cambridge.org/core/services/aop-cambridge-core/content/view/DC9BB0EED8EBCC6D7BE30C0FA62A1BB5/S1471068416000387a.pdf/div-class-title-stable-unstable-semantics-beyond-np-with-normal-logic-programs-div.pdf |
| PQID | 1828893153 |
| PQPubID | 43613 |
| PageCount | 17 |
| ParticipantIDs | proquest_miscellaneous_1855362757 proquest_journals_1828893153 crossref_citationtrail_10_1017_S1471068416000387 crossref_primary_10_1017_S1471068416000387 cambridge_journals_10_1017_S1471068416000387 |
| PublicationCentury | 2000 |
| PublicationDate | 20160900 2016-09-00 20160901 |
| PublicationDateYYYYMMDD | 2016-09-01 |
| PublicationDate_xml | – month: 09 year: 2016 text: 20160900 |
| PublicationDecade | 2010 |
| 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 | 2016 |
| Publisher | Cambridge University Press |
| Publisher_xml | – name: Cambridge University Press |
| References | Drescher (S1471068416000387_ref13) 2008 Janhunen (S1471068416000387_ref29) 2016 S1471068416000387_ref2 Stockmeyer (S1471068416000387_ref41) 1973 Oikarinen (S1471068416000387_ref39) 2006 S1471068416000387_ref5 S1471068416000387_ref7 S1471068416000387_ref23 S1471068416000387_ref24 Lindström (S1471068416000387_ref34) 1966; 32 S1471068416000387_ref8 Emerson (S1471068416000387_ref17) 1991 S1471068416000387_ref9 S1471068416000387_ref20 Nogueira (S1471068416000387_ref38) 2001 S1471068416000387_ref26 Tiihonen (S1471068416000387_ref42) 2003 S1471068416000387_ref27 S1471068416000387_ref28 Grasso (S1471068416000387_ref25) 2009 Eiter (S1471068416000387_ref15) 1997 Bogaerts (S1471068416000387_ref3) 2016 Gebser (S1471068416000387_ref21) 2007 Bomanson (S1471068416000387_ref6) 2013 S1471068416000387_ref32 S1471068416000387_ref10 S1471068416000387_ref11 S1471068416000387_ref35 Ricca (S1471068416000387_ref40) 2010; 105 S1471068416000387_ref30 S1471068416000387_ref31 S1471068416000387_ref18 S1471068416000387_ref14 S1471068416000387_ref37 S1471068416000387_ref16 Bogaerts (S1471068416000387_ref4) 2016 Lifschitz (S1471068416000387_ref33) 1999 Gelfond (S1471068416000387_ref22) 1988 Denecker (S1471068416000387_ref12) 2007 Andres (S1471068416000387_ref1) 2015 Mostowski (S1471068416000387_ref36) 1957; 44 Gebser (S1471068416000387_ref19) 2015 |
| References_xml | – ident: S1471068416000387_ref26 doi: 10.1016/j.jcss.2011.05.004 – ident: S1471068416000387_ref16 doi: 10.1017/S1471068405002577 – ident: S1471068416000387_ref32 – ident: S1471068416000387_ref18 doi: 10.1017/S1471068415000150 – start-page: 368 volume-title: Proceedings of the 13th International Conference on Logic Programming and Non-monotonic Reasoning, LPNMR 2015 year: 2015 ident: S1471068416000387_ref19 – ident: S1471068416000387_ref11 – start-page: 422 volume-title: Proceedings of the 11th International Conference on Principles of Knowledge Representation and Reasoning, KR 2008 year: 2008 ident: S1471068416000387_ref13 – start-page: 69 volume-title: Proceedings of the 13th International Conference on Logic Programming and Non-monotonic Reasoning, LPNMR 2015 year: 2015 ident: S1471068416000387_ref1 – start-page: 266 volume-title: Proceedings of the 9th International Conference on Logic Programming and Non-monotonic Reasoning, LPNMR 2007 year: 2007 ident: S1471068416000387_ref21 – start-page: 169 volume-title: Proceedings of the 3rd International Symposium on Practical Aspects of Declarative Languages, PADL 2001 year: 2001 ident: S1471068416000387_ref38 – volume: 32 start-page: 186 year: 1966 ident: S1471068416000387_ref34 article-title: First order predicate logic with generalized quantifiers publication-title: Theoria doi: 10.1111/j.1755-2567.1966.tb00600.x – start-page: 1290 volume-title: Proceedings of the 14th International Conference on Engineering Design, ICED 2003 year: 2003 ident: S1471068416000387_ref42 – start-page: 1070 volume-title: Proceedings of the Fifth International Conference on Logic Programming, ICLP 1988 year: 1988 ident: S1471068416000387_ref22 – ident: S1471068416000387_ref7 doi: 10.1007/s10817-007-9082-1 – ident: S1471068416000387_ref10 doi: 10.1016/j.artint.2015.09.008 – start-page: 187 volume-title: Proceedings of the 12th International Conference on Logic Programming and Non-monotonic Reasoning, LPNMR 2013 year: 2013 ident: S1471068416000387_ref6 – ident: S1471068416000387_ref31 doi: 10.1145/1149114.1149117 – start-page: 978 volume-title: Proceedings of the 30th AAAI Conference on Artificial Intelligence, AAAI 2016 year: 2016 ident: S1471068416000387_ref29 – start-page: 74 volume-title: Proceedings of the 15th International Conference on Principles of Knowledge Representation and Reasoning, KR 2016 year: 2016 ident: S1471068416000387_ref3 – start-page: 368 volume-title: Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, FOCS 1991 year: 1991 ident: S1471068416000387_ref17 – start-page: 289 volume-title: Proceedings of the 4th International Conference on Logic Programming and Non-monotonic Reasoning, LPNMR 1997 year: 1997 ident: S1471068416000387_ref15 – volume: 44 start-page: 12 year: 1957 ident: S1471068416000387_ref36 article-title: On a generalization of quantifiers. publication-title: Fundamenta Mathematicae doi: 10.4064/fm-44-1-12-36 – start-page: 591 volume-title: Proceedings of the 10th International Conference on Logic Programming and Non-monotonic Reasoning, LPNMR 2009 year: 2009 ident: S1471068416000387_ref25 – ident: S1471068416000387_ref5 doi: 10.1017/S1471068414000155 – start-page: 84 volume-title: Proceedings of the 9th International Conference on Logic Programming and Non-monotonic Reasoning, LPNMR 2007 year: 2007 ident: S1471068416000387_ref12 – ident: S1471068416000387_ref27 doi: 10.1007/s11222-015-9611-4 – ident: S1471068416000387_ref2 doi: 10.1007/BF01530761 – start-page: 23 volume-title: Proceedings of the 16th International Conference on Logic Programming, ICLP 1999 year: 1999 ident: S1471068416000387_ref33 – ident: S1471068416000387_ref35 doi: 10.1007/978-3-642-60085-2_17 – start-page: 412 volume-title: Proceedings of the 17th European Conference on Artificial Intelligence, ECAI 2006 year: 2006 ident: S1471068416000387_ref39 – start-page: 307 volume-title: Proceedings of the AAAI-16 Workshop on Beyond NP year: 2016 ident: S1471068416000387_ref4 – start-page: 1 volume-title: Proceedings of the 5th Annual ACM Symposium on Theory of Computing, STOC 1973 year: 1973 ident: S1471068416000387_ref41 – ident: S1471068416000387_ref24 doi: 10.1142/S0218194096000053 – ident: S1471068416000387_ref8 doi: 10.1017/S147106841400009X – ident: S1471068416000387_ref28 doi: 10.1145/1119439.1119440 – ident: S1471068416000387_ref30 doi: 10.1017/S1471068415000265 – volume: 105 start-page: 35 year: 2010 ident: S1471068416000387_ref40 article-title: A logic-based system for e-tourism. publication-title: Fundam. Inform. doi: 10.3233/FI-2010-357 – ident: S1471068416000387_ref20 doi: 10.1017/S1471068411000329 – ident: S1471068416000387_ref9 – ident: S1471068416000387_ref23 doi: 10.1007/BF03037169 – ident: S1471068416000387_ref14 doi: 10.1007/BF01536399 – ident: S1471068416000387_ref37 doi: 10.1023/A:1018930122475 |
| SSID | ssj0016324 |
| Score | 2.2283602 |
| Snippet | Standard answer set programming (ASP) targets at solving search problems from the first level of the polynomial time hierarchy (PH). Tackling search problems... |
| SourceID | proquest crossref cambridge |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 570 |
| SubjectTerms | Encoding Logic Logic programming Mathematical models Modelling Regular Papers Searching Semantics |
| Title | Stable-unstable semantics: Beyond NP with normal logic programs |
| URI | https://www.cambridge.org/core/product/identifier/S1471068416000387/type/journal_article https://www.proquest.com/docview/1828893153 https://www.proquest.com/docview/1855362757 |
| Volume | 16 |
| WOSCitedRecordID | wos000386589800005&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_MTpHBE8icEl_UjqRVQ2PI0hCsPLSNIUBO3Ubv79vtemRRF28VJKmpR8vZdf8l5-j5CzRGnuYB6xjCsMYWYk06kI2cBy2AOp2HCly2ATcjxW02ky8QduhXerrHViqajTucUz8kvAwQrWVhDQ6_cPhlGj0LrqQ2iskzYXoITRKCtZY0VAKvLydpFE7x4V1lZNpIzGREzjcWkdkz-5FX6vUb9VdLnujDr_rfE22fKIk95UU2SHrLl8l3TqaA7UC_cewPYFXqNiSwSM8EIL9wbd_mKLK1rdc6HjCcVzW5oj0H2lpdqk3sOr2CdPo-Hj3T3z4RWYDZJgwXQSaW6MyIKBdSrRQmfOhlIAIEphV-SiTHJtg8CKUKXCCIVs7S4Ls8jGHPR1cEBa-Tx3h4SaTBsZpSKCFocWMksDOymkwuc2ToTpkoumc2deSIpZ5WAmZ3_GoksGdf_PrKcqx4gZr6uKnDdF3iuejlWZe_WI_ahNM1xdctp8BmFDC4rO3XyJeaIoQF5nebT6F8dkE5BVXDmj9Uhr8bl0J2TDfi1eis8-ad8Ox5OHfjlb4TmJnr8BQz7rXg |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3dSxwxEB_sKbQvvWorvfZaI-hLcfGS_UhWkNIPRVGXoyj4tibZLAi6p-6d0n-qf2Nn9gulcG8-9G3JJmE3mcxHZuY3ABux0twhHXk5V1TCzEhPZyLwRpajDaQiw5Wuik3IJFHn5_F4Af60uTAUVtnyxIpRZxNLd-TbqAcrlK14QL_e3HpUNYq8q20JjZosjtzvBzTZyt3Dn7i_m0Ls753-OPCaqgKe9WN_6uk41NwYkfsj61Sshc6dDaRAPSBDY8CFueTa-r4VgcqEEYpAyl0e5KGNOLIpH-d9AYuBH0RhDxa_7yXjX53fgsDPq3wmSfFEKmj9qARSTY3UxqPKHycfozk8lYpPhUIl6fb7_9savYHXjU7NvtWHYBkWXLEC_bZeBWvY11s0TKaUKObNSCXGB1a6aySsS1vusDqThyVjRjfTrCBV_opVgoE1MWzlOzh7lt9YhV4xKdx7YCbXRoaZCHGFA4udpUFbkcD-uY1iYQaw1W1m2rCBMq1D6GT6z94PYNTud2obMHaqCXI1b8iXbshNjUQyr_OwpZBHX9ORxwDWu9fITshHpAs3mVGfMPQJuVp-mD_FGrw8OD05To8Pk6OP8Ar1yKgOvRtCb3o3c59gyd5PL8u7z80ZYXDx3CT3F69OSKM |
| 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=Stable-unstable+semantics%3A+Beyond+NP+with+normal+logic+programs&rft.jtitle=Theory+and+practice+of+logic+programming&rft.au=Bogaerts%2C+Bart&rft.au=Janhunen%2C+Tomi&rft.au=TASHARROFI%2C+SHAHAB&rft.au=Carro%2C+Manuel&rft.date=2016-09-01&rft.issn=1471-0684&rft.eissn=1475-3081&rft.volume=16&rft.issue=5-6&rft.spage=570&rft.epage=586&rft_id=info:doi/10.1017%2FS1471068416000387&rft.externalDBID=NO_FULL_TEXT |
| 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 |