P-log: refinement and a new coherency condition

This paper focuses on the investigation and improvement of knowledge representation language P-log that allows for both logical and probabilistic reasoning. We refine the definition of the language by eliminating some ambiguities and incidental decisions made in its original version and slightly mod...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Annals of mathematics and artificial intelligence Ročník 86; číslo 1-3; s. 149 - 192
Hlavní autoři: Balai, Evgenii, Gelfond, Michael, Zhang, Yuanlin
Médium: Journal Article
Jazyk:angličtina
Vydáno: Cham Springer International Publishing 01.07.2019
Springer
Springer Nature B.V
Témata:
ISSN:1012-2443, 1573-7470
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract This paper focuses on the investigation and improvement of knowledge representation language P-log that allows for both logical and probabilistic reasoning. We refine the definition of the language by eliminating some ambiguities and incidental decisions made in its original version and slightly modify the formal semantics to better match the intuitive meaning of the language constructs. We also define a new class of coherent (i.e., logically and probabilistically consistent) P-log programs which facilitates their construction and proofs of correctness. There are a query answering algorithm, sound for programs from this class, and a prototype implementation which, due to their size, are not included in the paper. They, however, can be found in the dissertation of the first author.
AbstractList This paper focuses on the investigation and improvement of knowledge representation language P-log that allows for both logical and probabilistic reasoning. We refine the definition of the language by eliminating some ambiguities and incidental decisions made in its original version and slightly modify the formal semantics to better match the intuitive meaning of the language constructs. We also define a new class of coherent (i.e., logically and probabilistically consistent) P-log programs which facilitates their construction and proofs of correctness. There are a query answering algorithm, sound for programs from this class, and a prototype implementation which, due to their size, are not included in the paper. They, however, can be found in the dissertation of the first author. Keywords Answer set programming * Probabilistic inference * Knowledge representation Mathematics Subject Classification (2010) 60 * 68
This paper focuses on the investigation and improvement of knowledge representation language P-log that allows for both logical and probabilistic reasoning. We refine the definition of the language by eliminating some ambiguities and incidental decisions made in its original version and slightly modify the formal semantics to better match the intuitive meaning of the language constructs. We also define a new class of coherent (i.e., logically and probabilistically consistent) P-log programs which facilitates their construction and proofs of correctness. There are a query answering algorithm, sound for programs from this class, and a prototype implementation which, due to their size, are not included in the paper. They, however, can be found in the dissertation of the first author.
Audience Academic
Author Zhang, Yuanlin
Gelfond, Michael
Balai, Evgenii
Author_xml – sequence: 1
  givenname: Evgenii
  orcidid: 0000-0002-3165-482X
  surname: Balai
  fullname: Balai, Evgenii
  email: evgenii.balai@gmail.com
  organization: Texas Tech University
– sequence: 2
  givenname: Michael
  surname: Gelfond
  fullname: Gelfond, Michael
  organization: Texas Tech University
– sequence: 3
  givenname: Yuanlin
  surname: Zhang
  fullname: Zhang, Yuanlin
  organization: Texas Tech University
BookMark eNp9kE1LAzEURYNUsK3-AVcDrtO-fMxkxl0pfkFBF7oOMfNSU6aZmpki_femjiC4KFnkEc5Jcu-EjEIbkJBrBjMGoOYdA6k4BVZRqAoOlJ-RMcuVoEoqGKUZGKdcSnFBJl23AUhYWYzJ_IU27fo2i-h8wC2GPjOhzkwW8Cuz7QdGDPaQplD73rfhkpw703R49btPydv93evyka6eH56WixW1Ii97WtRGoULGZSXcu8sZCiyAmUrlQhlppanROuA5s1A6VdWmUEypWjLHXclBTMnNcO8utp977Hq9afcxpCc1r1gicuAiUbOBWpsGtQ-u7aOxadW49enPKVQ6XyhWSFWVwJJQDoKNbdel0Nr63hyDJdE3moE-9qmHPnXqU__0qXlS-T91F_3WxMNpSQxSl-CwxvgX44T1DZrJh4s
CitedBy_id crossref_primary_10_1002_aaai_12053
crossref_primary_10_1016_j_robot_2023_104613
crossref_primary_10_1017_S1471068423000248
Cites_doi 10.1017/S1471068414000076
10.1109/34.204911
10.1609/aaai.v29i1.9385
10.1017/CBO9781139342124
10.1007/978-3-319-61660-5_14
10.1109/BRACIS.2013.33
10.1007/978-3-540-24609-1_5
10.1093/bjps/axi147
10.1016/S0304-3975(96)00128-4
10.1016/0890-5401(92)90061-J
10.1007/978-3-319-29354-7
10.1016/0004-3702(93)90061-F
10.1007/978-3-540-89982-2_36
10.1007/s10994-015-5494-z
10.1016/j.ijar.2006.06.012
10.1017/S1471068409003767
10.7551/mitpress/4298.003.0069
10.1613/jair.5482
10.1017/CBO9780511790423
10.1016/S0004-3702(97)00027-1
10.1017/S1471068414000222
10.3233/FI-1996-281205
10.1007/978-3-540-27775-0_30
10.1017/S1471068408003645
10.1007/BF03037169
ContentType Journal Article
Copyright Springer Nature Switzerland AG 2019
COPYRIGHT 2019 Springer
Springer Nature Switzerland AG 2019.
Copyright_xml – notice: Springer Nature Switzerland AG 2019
– notice: COPYRIGHT 2019 Springer
– notice: Springer Nature Switzerland AG 2019.
DBID AAYXX
CITATION
8FE
8FG
ABJCF
AFKRA
ARAPS
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
GNUQQ
HCIFZ
JQ2
K7-
L6V
M7S
P5Z
P62
PHGZM
PHGZT
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
DOI 10.1007/s10472-019-09620-2
DatabaseName CrossRef
ProQuest SciTech Collection
ProQuest Technology Collection
Materials Science & Engineering Collection
ProQuest Central
Advanced Technologies & Computer Science Collection
ProQuest Central Essentials - QC
ProQuest Central
ProQuest Technology Collection
ProQuest One
ProQuest Central Korea
ProQuest Central Student
SciTech Premium Collection
ProQuest Computer Science Collection
Computer Science Database
ProQuest Engineering Collection
Engineering 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)
ProQuest One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
Engineering Collection
DatabaseTitle CrossRef
Computer Science Database
ProQuest Central Student
Technology Collection
ProQuest One Academic Middle East (New)
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Computer Science Collection
SciTech Premium Collection
ProQuest One Community College
ProQuest Central China
ProQuest Central
ProQuest One Applied & Life Sciences
ProQuest Engineering Collection
ProQuest Central Korea
ProQuest Central (New)
Engineering Collection
Advanced Technologies & Aerospace Collection
Engineering Database
ProQuest One Academic Eastern Edition
ProQuest Technology Collection
ProQuest SciTech Collection
Advanced Technologies & Aerospace Database
ProQuest One Academic UKI Edition
Materials Science & Engineering Collection
ProQuest One Academic
ProQuest One Academic (New)
DatabaseTitleList

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 Mathematics
Computer Science
EISSN 1573-7470
EndPage 192
ExternalDocumentID A716479801
10_1007_s10472_019_09620_2
GrantInformation_xml – fundername: National Aeronautics and Space Administration
  grantid: NRA NNH11ZEA001N-SSAT2
  funderid: https://doi.org/10.13039/100000104
GroupedDBID -4Z
-59
-5G
-BR
-EM
-~C
.86
.DC
.VR
06D
0R~
0VY
1N0
203
23M
2J2
2JN
2JY
2KG
2LR
2~H
30V
4.4
406
408
409
40D
40E
5GY
5VS
67Z
6NX
8TC
8UJ
95-
95.
95~
96X
AAAVM
AABHQ
AACDK
AAHNG
AAIAL
AAJBT
AAJKR
AANZL
AARTL
AASML
AATNV
AATVU
AAUYE
AAWCG
AAYIU
AAYQN
AAYZH
ABAKF
ABBBX
ABBXA
ABDZT
ABECU
ABFTD
ABFTV
ABHLI
ABHQN
ABJCF
ABJNI
ABJOX
ABKCH
ABKTR
ABMNI
ABMQK
ABNWP
ABQBU
ABSXP
ABTEG
ABTHY
ABTKH
ABTMW
ABWNU
ABXPI
ACAOD
ACDTI
ACGFS
ACHSB
ACHXU
ACIWK
ACKNC
ACMDZ
ACMLO
ACOKC
ACOMO
ACPIV
ACSNA
ACZOJ
ADHHG
ADHIR
ADINQ
ADKNI
ADRFC
ADTPH
ADURQ
ADYFF
ADZKW
AEFQL
AEGAL
AEGNC
AEJHL
AEJRE
AEMSY
AENEX
AEOHA
AEPYU
AESKC
AETLH
AEVLU
AEXYK
AFBBN
AFKRA
AFLOW
AFQWF
AFWTZ
AFZKB
AGAYW
AGDGC
AGMZJ
AGQEE
AGQMX
AGRTI
AGWIL
AGWZB
AGYKE
AHAVH
AHBYD
AHKAY
AHSBF
AHYZX
AIAKS
AIGIU
AIIXL
AILAN
AITGF
AJRNO
AJZVZ
ALMA_UNASSIGNED_HOLDINGS
ALWAN
AMKLP
AMXSW
AMYLF
AMYQR
AOCGG
ARAPS
ARMRJ
ASPBG
AVWKF
AXYYD
AYJHY
AZFZN
B-.
BA0
BDATZ
BENPR
BGLVJ
BGNMA
BSONS
CCPQU
CS3
CSCUP
DDRTE
DL5
DNIVK
DPUIP
EBLON
EBS
EIOEI
EJD
ESBYG
F5P
FEDTE
FERAY
FFXSO
FIGPU
FINBP
FNLPD
FRRFC
FSGXE
FWDCC
GGCAI
GGRSB
GJIRD
GNWQR
GQ6
GQ7
GQ8
GXS
HCIFZ
HF~
HG5
HG6
HMJXF
HQYDN
HRMNR
HVGLF
I09
IAO
IJ-
IKXTQ
ITM
IWAJR
IXC
IZIGR
IZQ
I~X
I~Z
J-C
J0Z
JBSCW
JCJTX
JZLTJ
K7-
KDC
KOV
LAK
LLZTM
M4Y
M7S
MA-
NB0
NPVJJ
NQJWS
NU0
O93
O9G
O9I
O9J
OAM
P19
P2P
P9O
PF0
PT4
PT5
PTHSS
QOK
QOS
R89
R9I
RHV
RNS
ROL
RPX
RSV
S16
S27
S3B
SAP
SCO
SDH
SDM
SHX
SISQX
SJYHP
SNE
SNPRN
SNX
SOHCF
SOJ
SPISZ
SRMVM
SSLCW
STPWE
SZN
T13
TN5
TSG
TSK
TSV
TUC
U2A
UG4
UOJIU
UTJUX
VC2
W23
W48
WK8
YLTOR
Z45
Z7R
Z7X
Z81
Z83
Z88
Z92
ZMTXR
~A9
~EX
-Y2
1SB
2.D
28-
2P1
2VQ
5QI
AAOBN
AAPKM
AARHV
AAYTO
AAYXX
ABBRH
ABDBE
ABFSG
ABQSL
ABRTQ
ABULA
ACBXY
ACSTC
ADHKG
ADKFA
ADKPE
AEBTG
AEFIE
AEKMD
AEZWR
AFDZB
AFEXP
AFFHD
AFGCZ
AFHIU
AFOHR
AGGDS
AGJBK
AGQPQ
AHPBZ
AHWEU
AIXLP
AJBLW
ATHPR
AYFIA
BBWZM
CAG
CITATION
COF
HZ~
IHE
KOW
N2Q
NDZJH
O9-
OVD
PHGZM
PHGZT
PQGLB
R4E
RNI
RZC
RZE
RZK
S1Z
S26
S28
SCJ
SCLPG
T16
TEORI
UZXMN
VFIZW
8FE
8FG
AZQEC
DWQXO
GNUQQ
JQ2
L6V
P62
PKEHL
PQEST
PQQKQ
PQUKI
PRINS
ID FETCH-LOGICAL-c358t-6da7e7e12493fbf51e3e601a97537a4c4adecf0251c08f79da67177d41f2f8203
IEDL.DBID RSV
ISICitedReferencesCount 3
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000474356600007&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1012-2443
IngestDate Wed Nov 05 14:58:08 EST 2025
Sat Nov 29 09:48:21 EST 2025
Sat Nov 29 05:14:37 EST 2025
Tue Nov 18 22:36:13 EST 2025
Fri Feb 21 02:26:56 EST 2025
IsPeerReviewed true
IsScholarly true
Issue 1-3
Keywords 68
60
Probabilistic inference
Answer set programming
Knowledge representation
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c358t-6da7e7e12493fbf51e3e601a97537a4c4adecf0251c08f79da67177d41f2f8203
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0002-3165-482X
PQID 2918205023
PQPubID 2043872
PageCount 44
ParticipantIDs proquest_journals_2918205023
gale_infotracacademiconefile_A716479801
crossref_citationtrail_10_1007_s10472_019_09620_2
crossref_primary_10_1007_s10472_019_09620_2
springer_journals_10_1007_s10472_019_09620_2
PublicationCentury 2000
PublicationDate 20190701
2019-7-00
PublicationDateYYYYMMDD 2019-07-01
PublicationDate_xml – month: 7
  year: 2019
  text: 20190701
  day: 1
PublicationDecade 2010
PublicationPlace Cham
PublicationPlace_xml – name: Cham
– name: Dordrecht
PublicationTitle Annals of mathematics and artificial intelligence
PublicationTitleAbbrev Ann Math Artif Intell
PublicationYear 2019
Publisher Springer International Publishing
Springer
Springer Nature B.V
Publisher_xml – name: Springer International Publishing
– name: Springer
– name: Springer Nature B.V
References GelfondMZhangYVicious circle principle and logic programs with aggregatesTPLP2014144-558760132869871309.6803210.1017/S1471068414000222
PearlJCausality: Models, Reasoning, and Inference2000CambridgeCambridge University Press0959.68116
Halpern, J.Y.: A modification of the Halpern-Pearl definition of causality. In: Proceedings of the 24th International Conference on Artificial Intelligence, IJCAI’15, pp. 3022–3033. AAAI Press. http://dl.acm.org/citation.cfm?id=2832581.2832671 (2015)
HalpernJYPearlJCauses and explanations: a structural-model approach. Part I: CausesBr. J. Philos. Sci.200556484388710.1093/bjps/axi1471092.03003
Kersting, K., Raedt, L.D.: Bayesian logic programs. In: Inductive Logic Programming, 10th International Conference, ILP 2000, Work-in-progress reports, London, UK, July 2000, Proceedings. http://ceur-ws.org/Vol-35/07-KerstingDeRaedt.ps (2000)
JaynesETProbability Theory: The Logic of Science2003CambridgeCambridge University Press10.1017/CBO97805117904231045.62001
Pearl, J.: Reasoning with cause and effect. In: Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, IJCAI 99, Stockholm, Sweden, July 31 - August 6, 1999. vol. 2, 1450 pages, pp 1437–1449 (1999)
Sato, T., Kameya, Y.: PRISM: A language for symbolic-statistical modeling. In: Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, IJCAI 97, Nagoya, Japan, August 23-29, 1997, vol. 2, pp. 1330–1339. http://ijcai.org/Proceedings/97-2/Papers/078.pdf (1997)
DixJGottlobGMarekVWReducing disjunctive to non-disjunctive semantics by shift-operationsFundam. Inform.1996281-28710014323140863.6808810.3233/FI-1996-281205
NgRSubrahmanianVSProbabilistic logic programmingInf. Comput.19921012150201119405910.1016/0890-5401(92)90061-J0781.68038
Vennekens, J., Verbaeten, S., Bruynooghe, M.: Logic programs with annotated disjunctions. In: Logic Programming, 20th International Conference, ICLP 2004, Saint-Malo, France, September 6-10, 2004, Proceedings, pp. 431–445. https://doi.org/10.1007/978-3-540-27775-0_30 (2004)
NgoLHaddawyPAnswering queries from context-sensitive probabilistic knowledge basesTheor. Comput. Sci.19971711-2147177143596710.1016/S0304-3975(96)00128-40874.68280
LukasiewiczTProbabilistic description logic programsInt. J. Approx. Reason.2007452288307233982310.1016/j.ijar.2006.06.0121122.68027
Sato, T.: A statistical learning method for logic programs with distribution semantics. In: Inproceedings of the 12th International Conference on Logic Programming (ICLP’95), pp. 715–729. MIT Press (1995)
Zhu, W.: Plog: Its Algorithms and Applications. Ph.D. thesis, Texas Tech University (2012)
De Morais, E.M., Finger, M.: Probabilistic Answer Set Programming. In: Brazilian Conference on Intelligent Systems, BRACIS 2013, Fortaleza, CE, Brazil, 19-24 October, 2013, pp. 150–156. https://doi.org/10.1109/BRACIS.2013.33 (2013)
PooleDThe independent choice logic for modelling multiple agents under uncertaintyArtif. Intell.1997941-2756146431210.1016/S0004-3702(97)00027-10902.03017
FierensDVan den BroeckGRenkensJShterionovDGutmannBThonIJanssensGDe RaedtLInference and learning in probabilistic logic programs using weighted boolean formulasTheory Pract. Logic Program.2015153358401332549210.1017/S14710684140000761379.68062
Balai, E., Gelfond, M.: On the relationship between P-log and LPMLN. In: Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, New York, NY, USA, 9-15 July 2016, pp. 915–921. http://www.ijcai.org/Abstract/16/134 (2016)
Baral, C., Gelfond, M., Rushton, N.: Probabilistic Reasoning with Answer Sets. in: International Conference on Logic Programming and Nonmonotonic Reasoning, pp. 21–33. Springer (2004)
Lukasiewicz, T.: Probabilistic Logic Programming. In: ECAI, pp. 388–392 (1998)
BaralCGelfondMRushtonNProbabilistic reasoning with answer setsTheory Pract. Logic Program.200990157144248144210.1017/S14710684080036451170.68003
CozmanFGMauáDDOn the semantics and complexity of probabilistic logic programsJ. Artif. Intell. Res.201760221262371703110.1613/jair.548206797193
Balai, E., Gelfond, M.: Refining and generalizing P-log - preliminary report. In: Proceedings of the 10th Workshop on Answer Set Programming and Other Computing Paradigms co-located with the 14th International Conference on Logic Programming and Nonmonotonic Reasoning, ASPOCP@LPNMR 2017, Espoo, Finland, July 3, 2017. http://ceur-ws.org/Vol-1868/p6.pdf (2017)
Balai, E.: Investigating and Extending P-log. Ph.D. thesis, Texas Tech University (2017)
Gelfond, M., Rushton, N.: Causal and Probabilistic Reasoning in P-log. In: Dechter, R., Geffner, H., Halpern, J. (eds.) A Tribute to Judea Pearl, pp. 337-359, College Publications (2010)
Balai, E., Gelfond, M., Zhang, Y.: Towards answer set programming with sorts. In: Logic Programming and Nonmonotonic Reasoning, 12th International Conference, LPNMR 2013, Corunna, Spain, September 15-19, 2013. Proceedings, pp. 135–147 (2013)
VennekensJDeneckerMBruynoogheMCP-logic: a language of causal probabilistic events and its relation to logic programmingTheory Pract. Logic Program.200993245308252561510.1017/S14710684090037671179.68025
Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Logic Programming, Proceedings of the Fifth International Conference and Symposium, Seattle, Washington, August 15-19, 1988, vol. 2, pp. 1070–1080 (1988)
PooleDProbabilistic horn abduction and bayesian networksArtif. Intell.1993648112910.1016/0004-3702(93)90061-F0792.68176
Balduccini, M., Gelfond, M.: Logic programs with consistency-restoring rules. In: International Symposium on Logical Formalization of Commonsense Reasoning, AAAI 2003 Spring Symposium Series, pp. 9–18 (2003)
WellmanMPHenrionMExplaining ’explaining away’IEEE Trans. Pattern Anal. Mach. Intell.199315328729210.1109/34.2049110760.68068
Zhang, S., Stone, P.: Corpp: Commonsense reasoning and probabilistic planning, as applied to dialog with a mobile robot. In: Proceedings of the 29th Conference on Artificial Intelligence (AAAI) (2015)
De RaedtLKimmigAProbabilistic (logic) programming conceptsMach. Learn.20151001547337214610.1007/s10994-015-5494-z1346.68050
Gelfond, M., Zhang, Y.: Vicious circle principle and formation of sets in ASP based languages. In: Logic Programming and Nonmonotonic Reasoning, 14Th International Conference, LPNMR (2017)
Balduccini, M.: Answer set solving and non-herbrand functions. In: Proceedings of the 14th International Workshop on Non-Monotonic Reasoning (NMR’2012)(Jun 2012) (2012)
PereiraLMSaptawijayaAProgramming Machine Ethics20161st edn.BerlinSpringer Publishing Company, Incorporated10.1007/978-3-319-29354-7
Cabalar, P.: Partial functions and equality in answer set programming. In: Logic Programming, 24th International Conference, ICLP 2008, Udine, Italy, December 9-13 2008, Proceedings, pp. 392–406. https://doi.org/10.1007/978-3-540-89982-2_36 (2008)
GelfondMKahlYKnowledge Representation, Reasoning, and the Design of Intelligent Agents: The Answer-set Programming Approach2014CambridgeCambridge University Press10.1017/CBO9781139342124
Lifschitz, V., Turner, H.: Splitting a logic program. In; Logic Programming, Proceedings of the Eleventh International Conference on Logic Programming, Santa Marherita Ligure, Italy, June 13-18, 1994, pp. 23–37 (1994)
Raedt, L.D., Kimmig, A., Toivonen, H.: Problog: A probabilistic prolog and its application in link discovery. In: IJCAI 2007, Proceedings of the 20th International Joint Conference on Artificial Intelligence, Hyderabad, India, January 6-12, 2007, pp. 2462–2467 . http://ijcai.org/Proceedings/07/Papers/396.pdf (2007)
Bartholomew, M., Lee, J.: Stable models of multi-valued formulas: partial versus total functions. In: Principles of Knowledge Representation and Reasoning: Proceedings of the Fourteenth International Conference, KR 2014, Vienna, Austria, July 20-24, 2014. http://www.aaai.org/ocs/index.php/KR/KR14/paper/view/8020 (2014)
Lee, J., Wang, Y.: Weighted rules under the stable model semantics. In: Principles of Knowledge Representation and Reasoning: Proceedings of the Fifteenth International Conference, KR 2016, Cape Town, South Africa, April 25-29, 2016, pp. 145–154. http://www.aaai.org/ocs/index.php/KR/KR16/paper/view/12901 (2016)
Oikarinen, E., Janhunen, T.: Modular equivalence for normal logic programs. In: ECAI, vol. 6, pp. 412–416 (2006)
MuggletonSStochastic logic programsAdvances in Inductive Logic Programming1996322542641405173
Lee, J., Yang, Z.: LPMLN, weak constraints, and p-log. in: Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, February 4-9, 2017, pp. 1170–1177, San Francisco, California, USA (2017)
Baral, C., Hunsaker, M.: Using the probabilistic logic programming language P-log for causal and counterfactual reasoning and non-naive conditioning. In: IJCAI 2007, Proceedings of the 20th International Joint Conference on Artificial Intelligence, Hyderabad, India, January 6-12, 2007, pp. 243–249 (2007)
GelfondMLifschitzVClassical negation in logic programs and disjunctive databasesN. Gener. Comput.199193/436538610.1007/BF030371690735.68012
ET Jaynes (9620_CR24) 2003
9620_CR36
D Poole (9620_CR39) 1993; 64
FG Cozman (9620_CR12) 2017; 60
9620_CR35
9620_CR10
9620_CR11
J Dix (9620_CR14) 1996; 28
C Baral (9620_CR8) 2009; 9
9620_CR31
J Pearl (9620_CR37) 2000
LM Pereira (9620_CR38) 2016
9620_CR19
9620_CR17
9620_CR9
9620_CR7
9620_CR5
9620_CR6
9620_CR3
9620_CR4
D Poole (9620_CR40) 1997; 94
D Fierens (9620_CR15) 2015; 15
R Ng (9620_CR33) 1992; 101
L De Raedt (9620_CR13) 2015; 100
L Ngo (9620_CR34) 1997; 171
JY Halpern (9620_CR23) 2005; 56
9620_CR25
9620_CR47
9620_CR26
9620_CR48
9620_CR45
M Gelfond (9620_CR18) 1991; 9
9620_CR21
9620_CR43
9620_CR22
9620_CR41
9620_CR42
9620_CR1
9620_CR2
9620_CR29
9620_CR27
9620_CR28
T Lukasiewicz (9620_CR30) 2007; 45
M Gelfond (9620_CR20) 2014; 14
J Vennekens (9620_CR44) 2009; 9
S Muggleton (9620_CR32) 1996; 32
MP Wellman (9620_CR46) 1993; 15
M Gelfond (9620_CR16) 2014
References_xml – reference: Balai, E., Gelfond, M., Zhang, Y.: Towards answer set programming with sorts. In: Logic Programming and Nonmonotonic Reasoning, 12th International Conference, LPNMR 2013, Corunna, Spain, September 15-19, 2013. Proceedings, pp. 135–147 (2013)
– reference: Cabalar, P.: Partial functions and equality in answer set programming. In: Logic Programming, 24th International Conference, ICLP 2008, Udine, Italy, December 9-13 2008, Proceedings, pp. 392–406. https://doi.org/10.1007/978-3-540-89982-2_36 (2008)
– reference: GelfondMLifschitzVClassical negation in logic programs and disjunctive databasesN. Gener. Comput.199193/436538610.1007/BF030371690735.68012
– reference: Lee, J., Wang, Y.: Weighted rules under the stable model semantics. In: Principles of Knowledge Representation and Reasoning: Proceedings of the Fifteenth International Conference, KR 2016, Cape Town, South Africa, April 25-29, 2016, pp. 145–154. http://www.aaai.org/ocs/index.php/KR/KR16/paper/view/12901 (2016)
– reference: PooleDProbabilistic horn abduction and bayesian networksArtif. Intell.1993648112910.1016/0004-3702(93)90061-F0792.68176
– reference: DixJGottlobGMarekVWReducing disjunctive to non-disjunctive semantics by shift-operationsFundam. Inform.1996281-28710014323140863.6808810.3233/FI-1996-281205
– reference: Baral, C., Gelfond, M., Rushton, N.: Probabilistic Reasoning with Answer Sets. in: International Conference on Logic Programming and Nonmonotonic Reasoning, pp. 21–33. Springer (2004)
– reference: CozmanFGMauáDDOn the semantics and complexity of probabilistic logic programsJ. Artif. Intell. Res.201760221262371703110.1613/jair.548206797193
– reference: PooleDThe independent choice logic for modelling multiple agents under uncertaintyArtif. Intell.1997941-2756146431210.1016/S0004-3702(97)00027-10902.03017
– reference: Vennekens, J., Verbaeten, S., Bruynooghe, M.: Logic programs with annotated disjunctions. In: Logic Programming, 20th International Conference, ICLP 2004, Saint-Malo, France, September 6-10, 2004, Proceedings, pp. 431–445. https://doi.org/10.1007/978-3-540-27775-0_30 (2004)
– reference: Bartholomew, M., Lee, J.: Stable models of multi-valued formulas: partial versus total functions. In: Principles of Knowledge Representation and Reasoning: Proceedings of the Fourteenth International Conference, KR 2014, Vienna, Austria, July 20-24, 2014. http://www.aaai.org/ocs/index.php/KR/KR14/paper/view/8020 (2014)
– reference: Lee, J., Yang, Z.: LPMLN, weak constraints, and p-log. in: Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, February 4-9, 2017, pp. 1170–1177, San Francisco, California, USA (2017)
– reference: Pearl, J.: Reasoning with cause and effect. In: Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, IJCAI 99, Stockholm, Sweden, July 31 - August 6, 1999. vol. 2, 1450 pages, pp 1437–1449 (1999)
– reference: Halpern, J.Y.: A modification of the Halpern-Pearl definition of causality. In: Proceedings of the 24th International Conference on Artificial Intelligence, IJCAI’15, pp. 3022–3033. AAAI Press. http://dl.acm.org/citation.cfm?id=2832581.2832671 (2015)
– reference: Sato, T.: A statistical learning method for logic programs with distribution semantics. In: Inproceedings of the 12th International Conference on Logic Programming (ICLP’95), pp. 715–729. MIT Press (1995)
– reference: VennekensJDeneckerMBruynoogheMCP-logic: a language of causal probabilistic events and its relation to logic programmingTheory Pract. Logic Program.200993245308252561510.1017/S14710684090037671179.68025
– reference: Baral, C., Hunsaker, M.: Using the probabilistic logic programming language P-log for causal and counterfactual reasoning and non-naive conditioning. In: IJCAI 2007, Proceedings of the 20th International Joint Conference on Artificial Intelligence, Hyderabad, India, January 6-12, 2007, pp. 243–249 (2007)
– reference: NgoLHaddawyPAnswering queries from context-sensitive probabilistic knowledge basesTheor. Comput. Sci.19971711-2147177143596710.1016/S0304-3975(96)00128-40874.68280
– reference: Oikarinen, E., Janhunen, T.: Modular equivalence for normal logic programs. In: ECAI, vol. 6, pp. 412–416 (2006)
– reference: Balai, E., Gelfond, M.: Refining and generalizing P-log - preliminary report. In: Proceedings of the 10th Workshop on Answer Set Programming and Other Computing Paradigms co-located with the 14th International Conference on Logic Programming and Nonmonotonic Reasoning, ASPOCP@LPNMR 2017, Espoo, Finland, July 3, 2017. http://ceur-ws.org/Vol-1868/p6.pdf (2017)
– reference: Gelfond, M., Zhang, Y.: Vicious circle principle and formation of sets in ASP based languages. In: Logic Programming and Nonmonotonic Reasoning, 14Th International Conference, LPNMR (2017)
– reference: JaynesETProbability Theory: The Logic of Science2003CambridgeCambridge University Press10.1017/CBO97805117904231045.62001
– reference: Zhu, W.: Plog: Its Algorithms and Applications. Ph.D. thesis, Texas Tech University (2012)
– reference: Balduccini, M.: Answer set solving and non-herbrand functions. In: Proceedings of the 14th International Workshop on Non-Monotonic Reasoning (NMR’2012)(Jun 2012) (2012)
– reference: Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Logic Programming, Proceedings of the Fifth International Conference and Symposium, Seattle, Washington, August 15-19, 1988, vol. 2, pp. 1070–1080 (1988)
– reference: Gelfond, M., Rushton, N.: Causal and Probabilistic Reasoning in P-log. In: Dechter, R., Geffner, H., Halpern, J. (eds.) A Tribute to Judea Pearl, pp. 337-359, College Publications (2010)
– reference: Lukasiewicz, T.: Probabilistic Logic Programming. In: ECAI, pp. 388–392 (1998)
– reference: PereiraLMSaptawijayaAProgramming Machine Ethics20161st edn.BerlinSpringer Publishing Company, Incorporated10.1007/978-3-319-29354-7
– reference: GelfondMZhangYVicious circle principle and logic programs with aggregatesTPLP2014144-558760132869871309.6803210.1017/S1471068414000222
– reference: De Morais, E.M., Finger, M.: Probabilistic Answer Set Programming. In: Brazilian Conference on Intelligent Systems, BRACIS 2013, Fortaleza, CE, Brazil, 19-24 October, 2013, pp. 150–156. https://doi.org/10.1109/BRACIS.2013.33 (2013)
– reference: PearlJCausality: Models, Reasoning, and Inference2000CambridgeCambridge University Press0959.68116
– reference: Balai, E., Gelfond, M.: On the relationship between P-log and LPMLN. In: Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, New York, NY, USA, 9-15 July 2016, pp. 915–921. http://www.ijcai.org/Abstract/16/134 (2016)
– reference: LukasiewiczTProbabilistic description logic programsInt. J. Approx. Reason.2007452288307233982310.1016/j.ijar.2006.06.0121122.68027
– reference: WellmanMPHenrionMExplaining ’explaining away’IEEE Trans. Pattern Anal. Mach. Intell.199315328729210.1109/34.2049110760.68068
– reference: HalpernJYPearlJCauses and explanations: a structural-model approach. Part I: CausesBr. J. Philos. Sci.200556484388710.1093/bjps/axi1471092.03003
– reference: Lifschitz, V., Turner, H.: Splitting a logic program. In; Logic Programming, Proceedings of the Eleventh International Conference on Logic Programming, Santa Marherita Ligure, Italy, June 13-18, 1994, pp. 23–37 (1994)
– reference: Kersting, K., Raedt, L.D.: Bayesian logic programs. In: Inductive Logic Programming, 10th International Conference, ILP 2000, Work-in-progress reports, London, UK, July 2000, Proceedings. http://ceur-ws.org/Vol-35/07-KerstingDeRaedt.ps (2000)
– reference: Balduccini, M., Gelfond, M.: Logic programs with consistency-restoring rules. In: International Symposium on Logical Formalization of Commonsense Reasoning, AAAI 2003 Spring Symposium Series, pp. 9–18 (2003)
– reference: NgRSubrahmanianVSProbabilistic logic programmingInf. Comput.19921012150201119405910.1016/0890-5401(92)90061-J0781.68038
– reference: De RaedtLKimmigAProbabilistic (logic) programming conceptsMach. Learn.20151001547337214610.1007/s10994-015-5494-z1346.68050
– reference: BaralCGelfondMRushtonNProbabilistic reasoning with answer setsTheory Pract. Logic Program.200990157144248144210.1017/S14710684080036451170.68003
– reference: Sato, T., Kameya, Y.: PRISM: A language for symbolic-statistical modeling. In: Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, IJCAI 97, Nagoya, Japan, August 23-29, 1997, vol. 2, pp. 1330–1339. http://ijcai.org/Proceedings/97-2/Papers/078.pdf (1997)
– reference: Zhang, S., Stone, P.: Corpp: Commonsense reasoning and probabilistic planning, as applied to dialog with a mobile robot. In: Proceedings of the 29th Conference on Artificial Intelligence (AAAI) (2015)
– reference: FierensDVan den BroeckGRenkensJShterionovDGutmannBThonIJanssensGDe RaedtLInference and learning in probabilistic logic programs using weighted boolean formulasTheory Pract. Logic Program.2015153358401332549210.1017/S14710684140000761379.68062
– reference: Raedt, L.D., Kimmig, A., Toivonen, H.: Problog: A probabilistic prolog and its application in link discovery. In: IJCAI 2007, Proceedings of the 20th International Joint Conference on Artificial Intelligence, Hyderabad, India, January 6-12, 2007, pp. 2462–2467 . http://ijcai.org/Proceedings/07/Papers/396.pdf (2007)
– reference: Balai, E.: Investigating and Extending P-log. Ph.D. thesis, Texas Tech University (2017)
– reference: GelfondMKahlYKnowledge Representation, Reasoning, and the Design of Intelligent Agents: The Answer-set Programming Approach2014CambridgeCambridge University Press10.1017/CBO9781139342124
– reference: MuggletonSStochastic logic programsAdvances in Inductive Logic Programming1996322542641405173
– ident: 9620_CR5
– volume: 15
  start-page: 358
  issue: 3
  year: 2015
  ident: 9620_CR15
  publication-title: Theory Pract. Logic Program.
  doi: 10.1017/S1471068414000076
– ident: 9620_CR35
– volume: 15
  start-page: 287
  issue: 3
  year: 1993
  ident: 9620_CR46
  publication-title: IEEE Trans. Pattern Anal. Mach. Intell.
  doi: 10.1109/34.204911
– ident: 9620_CR47
  doi: 10.1609/aaai.v29i1.9385
– ident: 9620_CR1
– volume-title: Knowledge Representation, Reasoning, and the Design of Intelligent Agents: The Answer-set Programming Approach
  year: 2014
  ident: 9620_CR16
  doi: 10.1017/CBO9781139342124
– ident: 9620_CR21
  doi: 10.1007/978-3-319-61660-5_14
– ident: 9620_CR3
– ident: 9620_CR10
– ident: 9620_CR31
  doi: 10.1109/BRACIS.2013.33
– ident: 9620_CR7
  doi: 10.1007/978-3-540-24609-1_5
– ident: 9620_CR25
– ident: 9620_CR41
– ident: 9620_CR9
– volume: 56
  start-page: 843
  issue: 4
  year: 2005
  ident: 9620_CR23
  publication-title: Br. J. Philos. Sci.
  doi: 10.1093/bjps/axi147
– ident: 9620_CR27
– ident: 9620_CR29
– ident: 9620_CR48
– volume: 171
  start-page: 147
  issue: 1-2
  year: 1997
  ident: 9620_CR34
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/S0304-3975(96)00128-4
– ident: 9620_CR22
– volume: 101
  start-page: 150
  issue: 2
  year: 1992
  ident: 9620_CR33
  publication-title: Inf. Comput.
  doi: 10.1016/0890-5401(92)90061-J
– ident: 9620_CR19
– ident: 9620_CR43
– ident: 9620_CR17
– volume-title: Programming Machine Ethics
  year: 2016
  ident: 9620_CR38
  doi: 10.1007/978-3-319-29354-7
– volume: 64
  start-page: 81
  year: 1993
  ident: 9620_CR39
  publication-title: Artif. Intell.
  doi: 10.1016/0004-3702(93)90061-F
– volume-title: Causality: Models, Reasoning, and Inference
  year: 2000
  ident: 9620_CR37
– ident: 9620_CR11
  doi: 10.1007/978-3-540-89982-2_36
– ident: 9620_CR36
– volume: 100
  start-page: 5
  issue: 1
  year: 2015
  ident: 9620_CR13
  publication-title: Mach. Learn.
  doi: 10.1007/s10994-015-5494-z
– ident: 9620_CR6
– volume: 45
  start-page: 288
  issue: 2
  year: 2007
  ident: 9620_CR30
  publication-title: Int. J. Approx. Reason.
  doi: 10.1016/j.ijar.2006.06.012
– ident: 9620_CR4
– volume: 9
  start-page: 245
  issue: 3
  year: 2009
  ident: 9620_CR44
  publication-title: Theory Pract. Logic Program.
  doi: 10.1017/S1471068409003767
– ident: 9620_CR2
– volume: 32
  start-page: 254
  year: 1996
  ident: 9620_CR32
  publication-title: Advances in Inductive Logic Programming
– ident: 9620_CR42
  doi: 10.7551/mitpress/4298.003.0069
– ident: 9620_CR28
– ident: 9620_CR26
– volume: 60
  start-page: 221
  year: 2017
  ident: 9620_CR12
  publication-title: J. Artif. Intell. Res.
  doi: 10.1613/jair.5482
– volume-title: Probability Theory: The Logic of Science
  year: 2003
  ident: 9620_CR24
  doi: 10.1017/CBO9780511790423
– volume: 94
  start-page: 7
  issue: 1-2
  year: 1997
  ident: 9620_CR40
  publication-title: Artif. Intell.
  doi: 10.1016/S0004-3702(97)00027-1
– volume: 14
  start-page: 587
  issue: 4-5
  year: 2014
  ident: 9620_CR20
  publication-title: TPLP
  doi: 10.1017/S1471068414000222
– volume: 28
  start-page: 87
  issue: 1-2
  year: 1996
  ident: 9620_CR14
  publication-title: Fundam. Inform.
  doi: 10.3233/FI-1996-281205
– ident: 9620_CR45
  doi: 10.1007/978-3-540-27775-0_30
– volume: 9
  start-page: 57
  issue: 01
  year: 2009
  ident: 9620_CR8
  publication-title: Theory Pract. Logic Program.
  doi: 10.1017/S1471068408003645
– volume: 9
  start-page: 365
  issue: 3/4
  year: 1991
  ident: 9620_CR18
  publication-title: N. Gener. Comput.
  doi: 10.1007/BF03037169
SSID ssj0009686
Score 2.1969495
Snippet This paper focuses on the investigation and improvement of knowledge representation language P-log that allows for both logical and probabilistic reasoning. We...
SourceID proquest
gale
crossref
springer
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 149
SubjectTerms Algorithms
Artificial Intelligence
Boolean
Cognition & reasoning
Complex Systems
Computer Science
Knowledge representation
Language
Mathematical functions
Mathematics
Semantics
Syntax
SummonAdditionalLinks – databaseName: Computer Science Database
  dbid: K7-
  link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LS8NAEB60etCD1apYrZKD4EGXNs9NvEgRiyCWHhR6Wzb7QEHa2lTBf-9MumlR0Yu3QLKbTeaxO7sz3wdwGoWWMEkMwwvLItshk7IZyxWPbWBkpnJdkk3wfj8dDrOB23ArXFpl5RNLR63HivbI20FGUOMxTjFXk1dGrFF0uuooNFZhzQ8Cn_T8jrMl6G5SMj0ShBXDaSx0RTOudC7ilJRACUMJhlDBl4npu3v-cU5aTj-9-n8Hvg1bbuHpdeeasgMrZtSAekXq4Dkbb8Dm_QLItdiF9oChc7z0cLi4HKWdRE-OtCc9XI17avxUFgt-4BWdfKOI9-Cxd_NwfcscxwJTYZzOWKIlN9wQBXVocxv7JjQYo0mqt-UyUpHURlkKRFQntTzTMsEAkOvIt4HF7wr3oTYaj8wBeDpMEz_t5DpPbaR9lSdZYoxM4izMc26DJvjVDxbKAZATD8aLWEInk1AECkWUQhHY5nzRZjKH3_jz6TOSmyDbxJ6VdCUGOD5CuRJdCg55hsrZhFYlLOGMthBLSTXhohL38vbv7z38u7cj2AhKRaMk3xbUZtM3cwzr6n32XExPSpX9BOet7dc
  priority: 102
  providerName: ProQuest
Title P-log: refinement and a new coherency condition
URI https://link.springer.com/article/10.1007/s10472-019-09620-2
https://www.proquest.com/docview/2918205023
Volume 86
WOSCitedRecordID wos000474356600007&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: 1573-7470
  dateEnd: 20241207
  omitProxy: false
  ssIdentifier: ssj0009686
  issn: 1012-2443
  databaseCode: P5Z
  dateStart: 19970301
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/hightechjournals
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Computer Science Database
  customDbUrl:
  eissn: 1573-7470
  dateEnd: 20241207
  omitProxy: false
  ssIdentifier: ssj0009686
  issn: 1012-2443
  databaseCode: K7-
  dateStart: 19970301
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/compscijour
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Engineering Database
  customDbUrl:
  eissn: 1573-7470
  dateEnd: 20241207
  omitProxy: false
  ssIdentifier: ssj0009686
  issn: 1012-2443
  databaseCode: M7S
  dateStart: 19970301
  isFulltext: true
  titleUrlDefault: http://search.proquest.com
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 1573-7470
  dateEnd: 20241207
  omitProxy: false
  ssIdentifier: ssj0009686
  issn: 1012-2443
  databaseCode: BENPR
  dateStart: 19970301
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVAVX
  databaseName: SpringerLINK Contemporary 1997-Present
  customDbUrl:
  eissn: 1573-7470
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0009686
  issn: 1012-2443
  databaseCode: RSV
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22
  providerName: Springer Nature
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LSwMxEB60etCD1apYrWUPggcNdp_Z9ValIoil-EK8hGweKMhW2ir4753Z7ra-QS9LYJNsmEcys5n5BmAn8C1hkhiGDcsC2yKVsglLFQ-tZ2SiUp0Xm-Ddbnx7m_SKpLBhGe1eXknmO_W7ZLeAUxgBhfhE6PTgxjuHx11M6nhxeTOF2o3y-o4EXMXw8PKLVJnv5_hwHH3elL_cjuaHzkn1f8tdhqXCyHTaY6lYgRmT1aBaFnBwCn2uweL5BLR1uAoHPYYb4aGDi0TTk_4aOjLTjnTQ8nZU_z5PDHzFFt1yIzvX4Pqkc3V8yop6Ckz5YTxikZbccEPlpn2b2tA1vkF_TFJuLZeBCqQ2ypLToVqx5YmWETp7XAeu9SxaCv46VLJ-ZjbA0X4cuXEr1WlsA-2qNEoiY2QUJn6acuvVwS3JKlQBNk41Lx7FFCaZ6COQPiKnj8Axe5MxT2OojV977xK3BOkhzqxkkU6A6yNEK9EmR5AnKIh1aJQMFYWCDoWXEHJ9iBZLHfZLBk5f__zdzb9134IFL5cBCvBtQGU0eDbbMK9eRg_DQRPmjjrd3kUTZs84a1Lc6SU-e-FdMxfpN0mj6Jw
linkProvider Springer Nature
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LT-MwEB7xkoDD8taWLeADiANYNHESJ0gIIR4CFSoOIHEzjh8CadUC7S7qn9rfuDNpQgUIbhy4WUrsOPbnGY898w3AeiQ8cZI4jgXPI9-gJeUznhsZ-9DpzOS2SDYhW6305ia7HIF_VSwMuVVWMrEQ1LZj6Ix8J8yIajxGFbP_8MgpaxTdrlYpNAawaLr-M5ps3b2zI5zfjTA8Ob46POVlVgFuRJz2eGK1dNJR0mXhcx8HTji0SjRFmEodmUhbZzxtvU0j9TKzOkGTR9oo8KHHLghsdxTGI5FK4upvSj4k-U2KzJJEmcVRbYoySKcM1YskOUGQg1KCJlv4ShG-VQfv7mULdXcy890GahZ-lBtrdjBYCXMw4trzMFMlrWClDJuH6YsXotruAuxcchT-uwyHB7fbdFLKdNsyzdDaYKZzVwRD9rFEN_sI4UW4_pKfWIKxdqftfgKzIk2CtJHbPPWRDUyeZIlzOokzkefShzUIqglVpiRYpzwfv9WQGppAoBAEqgCBwjpbL3UeBvQin769SThRJHuwZaPLEArsH7F4qQMyfmWGi68G9QocqhRKXTVERg22K3gNH3_83eXPW1uDydOri3N1ftZq_oKpsAA5OTTXYaz39MetwIT527vvPq0Wy4XB7VfD7j8nGUql
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LSwMxEB6kiujBalWsVt2D4EGXdp_Z9VbUoqil4IPeQjYPFGRb2ir4753Z7rb1CeItsEk2zCOZSWa-ATjwPUOYJNrGhrF90yCVMrGdSBYYV4tYJiorNsHa7ajbjTszWfxZtHvxJDnOaSCUpnRU7ytTn0l88xmFFFC4T4gOEG7C8z4VDSJ__fZhCrsbZrUeCcTKxoPMy9Nmvp_jw9H0eYP-8lKaHUCt8v-XvgorufFpNcfSsgZzOq1AuSjsYOV6XoHlmwmY63Ad6h0bN8gTCxeMJindJloiVZaw0CK3ZO8xSxh8wxa9fiObN-C-dX53emHndRZs6QXRyA6VYJppKkPtmcQEjvY0-mmCcm6Z8KUvlJaGnBHZiAyLlQjRCWTKd4xr0ILwNqGU9lK9BZbyotCJGolKIuMrRyZhHGotwiD2koQZtwpOQWIucxByqoXxzKfwyUQfjvThGX04jjmajOmPITh-7X1InOOknzizFHmaAa6PkK54kxxEFqOAVqFWMJfnijvkbkyI9gFaMlU4Lpg5_fzzf7f_1n0fFjtnLX592b7agSU3EweKAa5BaTR40buwIF9HT8PBXibP7xTV8AI
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=P-log%3A+refinement+and+a+new+coherency+condition&rft.jtitle=Annals+of+mathematics+and+artificial+intelligence&rft.au=Balai%2C+Evgenii&rft.au=Gelfond%2C+Michael&rft.au=Zhang%2C+Yuanlin&rft.date=2019-07-01&rft.pub=Springer+International+Publishing&rft.issn=1012-2443&rft.eissn=1573-7470&rft.volume=86&rft.issue=1-3&rft.spage=149&rft.epage=192&rft_id=info:doi/10.1007%2Fs10472-019-09620-2&rft.externalDocID=10_1007_s10472_019_09620_2
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1012-2443&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1012-2443&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1012-2443&client=summon