No Cover Image

Journal article 1023 views 188 downloads

Probabilistic sentence satisfiability: An approach to PSAT

T.C. Henderson, R. Simmons, B. Serbinowski, M. Cline, D. Sacharny, Xiuyi Fan Orcid Logo, A. Mitiche

Artificial Intelligence, Volume: 278, Start page: 103199

Swansea University Author: Xiuyi Fan Orcid Logo

  • 52818.pdf

    PDF | Accepted Manuscript

    Released under the terms of a Creative Commons Attribution Non-Commercial No Derivatives License (CC-BY-NC-ND).

    Download (531.6KB)

Check full text

DOI (Published version): 10.1016/j.artint.2019.103199

Published in: Artificial Intelligence
ISSN: 0004-3702
Published: Elsevier BV 2020
Online Access: Check full text

URI: https://cronfa.swan.ac.uk/Record/cronfa52818
first_indexed 2019-11-21T19:12:48Z
last_indexed 2020-06-26T13:05:37Z
id cronfa52818
recordtype SURis
fullrecord <?xml version="1.0"?><rfc1807><datestamp>2020-06-26T11:56:51.3795547</datestamp><bib-version>v2</bib-version><id>52818</id><entry>2019-11-21</entry><title>Probabilistic sentence satisfiability: An approach to PSAT</title><swanseaauthors><author><sid>a88a07c43b3e80f27cb96897d1bc2534</sid><ORCID>0000-0003-1223-9986</ORCID><firstname>Xiuyi</firstname><surname>Fan</surname><name>Xiuyi Fan</name><active>true</active><ethesisStudent>false</ethesisStudent></author></swanseaauthors><date>2019-11-21</date><deptcode>MACS</deptcode><abstract/><type>Journal Article</type><journal>Artificial Intelligence</journal><volume>278</volume><paginationStart>103199</paginationStart><publisher>Elsevier BV</publisher><issnPrint>0004-3702</issnPrint><keywords>PSAT, Probabilistic knowledge base, Nonlinear systems</keywords><publishedDay>1</publishedDay><publishedMonth>1</publishedMonth><publishedYear>2020</publishedYear><publishedDate>2020-01-01</publishedDate><doi>10.1016/j.artint.2019.103199</doi><url/><notes/><college>COLLEGE NANME</college><department>Mathematics and Computer Science School</department><CollegeCode>COLLEGE CODE</CollegeCode><DepartmentCode>MACS</DepartmentCode><institution>Swansea University</institution><apcterm/><lastEdited>2020-06-26T11:56:51.3795547</lastEdited><Created>2019-11-21T12:34:37.2956538</Created><authors><author><firstname>T.C.</firstname><surname>Henderson</surname><order>1</order></author><author><firstname>R.</firstname><surname>Simmons</surname><order>2</order></author><author><firstname>B.</firstname><surname>Serbinowski</surname><order>3</order></author><author><firstname>M.</firstname><surname>Cline</surname><order>4</order></author><author><firstname>D.</firstname><surname>Sacharny</surname><order>5</order></author><author><firstname>Xiuyi</firstname><surname>Fan</surname><orcid>0000-0003-1223-9986</orcid><order>6</order></author><author><firstname>A.</firstname><surname>Mitiche</surname><order>7</order></author></authors><documents><document><filename>52818__15998__9c1930729f4f4889a4b44f0647649ca0.pdf</filename><originalFilename>52818.pdf</originalFilename><uploaded>2019-11-29T11:18:35.6938122</uploaded><type>Output</type><contentLength>544358</contentLength><contentType>application/pdf</contentType><version>Accepted Manuscript</version><cronfaStatus>true</cronfaStatus><embargoDate>2020-11-04T00:00:00.0000000</embargoDate><documentNotes>Released under the terms of a Creative Commons Attribution Non-Commercial No Derivatives License (CC-BY-NC-ND).</documentNotes><copyrightCorrect>true</copyrightCorrect></document></documents><OutputDurs/></rfc1807>
spelling 2020-06-26T11:56:51.3795547 v2 52818 2019-11-21 Probabilistic sentence satisfiability: An approach to PSAT a88a07c43b3e80f27cb96897d1bc2534 0000-0003-1223-9986 Xiuyi Fan Xiuyi Fan true false 2019-11-21 MACS Journal Article Artificial Intelligence 278 103199 Elsevier BV 0004-3702 PSAT, Probabilistic knowledge base, Nonlinear systems 1 1 2020 2020-01-01 10.1016/j.artint.2019.103199 COLLEGE NANME Mathematics and Computer Science School COLLEGE CODE MACS Swansea University 2020-06-26T11:56:51.3795547 2019-11-21T12:34:37.2956538 T.C. Henderson 1 R. Simmons 2 B. Serbinowski 3 M. Cline 4 D. Sacharny 5 Xiuyi Fan 0000-0003-1223-9986 6 A. Mitiche 7 52818__15998__9c1930729f4f4889a4b44f0647649ca0.pdf 52818.pdf 2019-11-29T11:18:35.6938122 Output 544358 application/pdf Accepted Manuscript true 2020-11-04T00:00:00.0000000 Released under the terms of a Creative Commons Attribution Non-Commercial No Derivatives License (CC-BY-NC-ND). true
title Probabilistic sentence satisfiability: An approach to PSAT
spellingShingle Probabilistic sentence satisfiability: An approach to PSAT
Xiuyi Fan
title_short Probabilistic sentence satisfiability: An approach to PSAT
title_full Probabilistic sentence satisfiability: An approach to PSAT
title_fullStr Probabilistic sentence satisfiability: An approach to PSAT
title_full_unstemmed Probabilistic sentence satisfiability: An approach to PSAT
title_sort Probabilistic sentence satisfiability: An approach to PSAT
author_id_str_mv a88a07c43b3e80f27cb96897d1bc2534
author_id_fullname_str_mv a88a07c43b3e80f27cb96897d1bc2534_***_Xiuyi Fan
author Xiuyi Fan
author2 T.C. Henderson
R. Simmons
B. Serbinowski
M. Cline
D. Sacharny
Xiuyi Fan
A. Mitiche
format Journal article
container_title Artificial Intelligence
container_volume 278
container_start_page 103199
publishDate 2020
institution Swansea University
issn 0004-3702
doi_str_mv 10.1016/j.artint.2019.103199
publisher Elsevier BV
document_store_str 1
active_str 0
published_date 2020-01-01T04:44:37Z
_version_ 1851095124276150272
score 11.089407

Similar Items