@article{DohSza:2024:1816604,
    author = {Patrick Doherty and Andrzej Szalas},
    title = {{Dual forgetting operators in the context of weakest sufficient and strongest necessary conditions}},
    year = {2024},
    journal = {Artificial Intelligence},
    volume = {326},
    publisher = {ELSEVIER},
    issn = {0004-3702},
    doi = {10.1016/j.artint.2023.104036},
    note = {Funding Agencies|ELLIIT Network Organization for Information and Communication Technology, Sweden; Mahasarakham Development Fund, Mahasarakham University, Thailand; National Science Centre Poland [2017/27/B/ST6/02018]},
}

@article{DunSza:2023:1818463,
    author = {Barbara Dunin-Keplicz and Andrzej Szalas},
    title = {{Modeling and shadowing paraconsistent BDI agents}},
    year = {2023},
    journal = {Annals of Mathematics and Artificial Intelligence},
    publisher = {SPRINGER},
    issn = {1012-2443},
    doi = {10.1007/s10472-023-09902-w},
    note = {Funding Agencies|Narodowe Centrum Nauki [2015/19/B/ST6/02589]; National Science Centre Poland},
}

@article{DohSza:2022:1681176,
    author = {Patrick Doherty and Andrzej Szalas},
    title = {{A landscape and implementation framework for probabilistic rough sets using PROBLOG}},
    year = {2022},
    journal = {Information Sciences},
    volume = {593},
    pages = {546--576},
    publisher = {Elsevier Science Inc},
    issn = {0020-0255},
    doi = {10.1016/j.ins.2021.12.062},
    note = {Funding Agencies|ELLIIT Network Organization for Information and Communication Technology, Sweden; Swedish Foundation for Strategic Research SSF [RIT15-0097]; Guangdong Department of Science and Technology, China [2020A1313030098]; National Science Centre Poland [2017/27/B/ST6/02018]},
}

@article{DohSza:2021:1521594,
    author = {Patrick Doherty and Andrzej Szalas},
    title = {{Rough set reasoning using answer set programs}},
    year = {2021},
    journal = {International Journal of Approximate Reasoning},
    volume = {130},
    number = {March},
    pages = {126--149},
    publisher = {Elsevier},
    issn = {0888-613X},
    doi = {10.1016/j.ijar.2020.12.010},
    note = {Funding: ELLIIT Network Organization for Information and Communication Technology, Sweden; Swedish Foundation for Strategic Research SSF(Smart Systems Project) [RIT15-0097]; Jinan University (Zhuhai Campus); National Science Centre PolandNational Science Centre, Poland [2017/27/B/ST6/02018]},
}

@article{Sza:2020:1467612,
    author = {Andrzej Szalas},
    title = {{On the Probability and Cost of Ignorance, Inconsistency, Nonsense and More}},
    year = {2020},
    journal = {Journal of Multiple-Valued Logic and Soft Computing},
    volume = {34},
    number = {5-6},
    pages = {423--450},
    publisher = {Old City Publishing},
    issn = {1542-3980},
    note = {Funding agencies:\  National Science Centre PolandNational Science Center, PolandNational Science Centre, Poland [2017/27/B/ST6/02018]},
}

@article{Sza:2020:1465035,
    author = {Andrzej Szalas},
    title = {{A Paraconsistent ASP-like Language with Tractable Model Generation}},
    year = {2020},
    journal = {Journal of Applied Logics - IfCoLog Journal of Logic and Applications},
    volume = {7},
    number = {3},
    pages = {361--389},
    publisher = {College Publications},
    issn = {2631-9810},
    note = {Funding agencies:\ This work has been supported by grant 2017/27/B/ST6/02018 of the National Science Centre Poland.},
}

@article{BiaDunSza:2019:1349575,
    author = {Lukasz Bialek and Barbara Dunin-Keplicz and Andrzej Szalas},
    title = {{A paraconsistent approach to actions in informationally complex environments}},
    year = {2019},
    journal = {Annals of Mathematics and Artificial Intelligence},
    volume = {86},
    number = {4},
    pages = {231--255},
    publisher = {SPRINGER},
    issn = {1012-2443},
    doi = {10.1007/s10472-019-09627-9},
    note = {Funding Agencies|Polish National Science Centre [2015/19/B/ST6/02589]; ELLIIT Network Organization for Information and Communication Technology; Swedish Foundation for Strategic Research FSR (SymbiKBot Project)},
}

@article{SzkBiaSza:2019:1329198,
    author = {Jacek Szklarski and Lukasz Bialek and Andrzej Szalas},
    title = {{Paraconsistent Reasoning in Cops and Robber Game with Uncertain Information: A Simulation-Based Analysis}},
    year = {2019},
    journal = {International Journal of Uncertainty Fuzziness and Knowledge-Based Systems},
    volume = {27},
    number = {3},
    pages = {429--455},
    publisher = {WORLD SCIENTIFIC PUBL CO PTE LTD},
    issn = {0218-4885},
    doi = {10.1142/S021848851950020X},
    note = {Funding Agencies|Polish National Science Centre [2012/05/B/ST6/03094, 2015/19/B/ST6/02589]},
}

@article{DeADiMSza:2018:1270915,
    author = {Francesco Luca De Angelis and Giovanna Di Marzo Serugendo and Andrzej Szalas},
    title = {{Paraconsistent Rule-Based Reasoning with Graded Truth Values}},
    year = {2018},
    journal = {},
    volume = {5},
    number = {1},
    pages = {185--220},
    publisher = {College Publications},
}

@article{NguNguSza:2015:843859,
    author = {Linh Anh Nguyen and Thi-Bich-Loc Nguyen and Andrzej Szalas},
    title = {{Towards richer rule languages with polynomial data complexity for the Semantic Web}},
    year = {2015},
    journal = {Data \& Knowledge Engineering},
    volume = {96-97},
    pages = {57--77},
    publisher = {ELSEVIER SCIENCE BV},
    issn = {0169-023X},
    doi = {10.1016/j.datak.2015.04.005},
}

@article{DunStrEtAl:2015:788784,
    author = {Barbara Dunin-Keplicz and Alina Strachocka and Andrzej Szalas and Rineke Verbrugge},
    title = {{Paraconsistent semantics of speech acts}},
    year = {2015},
    journal = {Neurocomputing},
    volume = {151},
    number = {2},
    pages = {943--952},
    publisher = {Elsevier},
    issn = {0925-2312},
    doi = {10.1016/j.neucom.2014.10.001},
}

@article{NguNguSza:2014:850318,
    author = {Linh Anh Nguyen and Thi-Bich-Loc Nguyen and Andrzej Szalas},
    title = {{A Horn Fragment with PTime Data Complexity of Regular Description Logic with Inverse}},
    year = {2014},
    journal = {VNU Journal of Computer Science and Communication Engineering},
    volume = {30},
    number = {4},
    pages = {14--28},
    issn = {0866-8612},
}

@article{CaoNguSza:2014:723537,
    author = {Son Thanh Cao and Linh Anh Nguyen and Andrzej Szalas},
    title = {{WORL: a nonmonotonic rule language for the semantic web}},
    year = {2014},
    journal = {},
    volume = {1},
    number = {1},
    pages = {57--69},
    publisher = {Springer Berlin/Heidelberg},
    doi = {10.1007/s40595-013-0009-y},
}

@article{DohSza:2013:662860,
    author = {Patrick Doherty and Andrzej Szalas},
    title = {{Automated Generation of Logical Constraints on Approximation Spaces Using Quantifier Elimination}},
    year = {2013},
    journal = {Fundamenta Informaticae},
    volume = {127},
    number = {1-4},
    pages = {135--149},
    publisher = {IOS Press},
    issn = {0169-2968},
    doi = {10.3233/FI-2013-900},
    note = {Funding Agencies|Swedish Research Council (VR) Linnaeus Center CADICS||ELLIIT Excellence Center at Linkoping-Lund in Information Technology||CUAS project||SSF, the Swedish Foundation for Strategic Research||},
}

@article{Sza:2013:642893,
    author = {Andrzej Szalas},
    title = {{How an agent might think}},
    year = {2013},
    journal = {Logic journal of the IGPL (Print)},
    volume = {21},
    number = {3},
    pages = {515--535},
    publisher = {Oxford University Press (OUP): Policy A - Oxford Open Option A},
    issn = {1367-0751},
    doi = {10.1093/jigpal/jzs051},
}

@article{DunNguSza:2011:461548,
    author = {Barbara Dunin-Keplicz and Anh Linh Nguyen and Andrzej Szalas},
    title = {{Converse-PDL with Regular Inclusion Axioms: A Framework for MAS Logics}},
    year = {2011},
    journal = {Journal of Applied Non-Classical Logics},
    volume = {21},
    number = {1},
    pages = {61--91},
    publisher = {Lavoisier},
    issn = {1166-3081},
    doi = {10.3166/JANCL.21.61-91},
}

@article{NguSza:2011:461546,
    author = {Linh Anh Nguyen and Andrzej Szalas},
    title = {{ExpTime Tableau Decision Procedures for Regular Grammar Logics with Converse}},
    year = {2011},
    journal = {Studia Logica: An International Journal for Symbolic Logic},
    volume = {98},
    number = {3},
    pages = {387--428},
    publisher = {Springer Berlin/Heidelberg},
    issn = {0039-3215},
    doi = {10.1007/s11225-011-9341-3},
}

@article{MalSza:2011:461544,
    author = {Jan Maluszynski and Andrzej Szalas},
    title = {{Logical Foundations and Complexity of 4QL, a Query Language with Unrestricted Negation}},
    year = {2011},
    journal = {Journal of Applied Non-Classical Logics},
    volume = {21},
    number = {2},
    pages = {211--232},
    publisher = {Lavoisier},
    issn = {1166-3081},
    doi = {10.3166/JANCL.21.211-232},
}

@article{NguSza:2010:400673,
    author = {Anh Linh Nguyen and Andrzej Szalas},
    title = {{Tableaux with Global Caching for Checking Satisfiability of a Knowledge Base in the Description Logic SH}},
    year = {2010},
    journal = {Transactions on Computational Collective Intelligence},
    volume = {1},
    number = {1},
    pages = {21--38},
    publisher = {Springer},
    isbn = {978-3-642-15033-3},
    issn = {0302-9743},
    doi = {10.1007/978-3-642-15034-0\_2},
}

@article{NguSza:2010:371275,
    author = {Linh Anh Nguyen and Andrzej Szalas},
    title = {{Checking Consistency of an ABox w.r.t. Global Assumptions in PDL}},
    year = {2010},
    journal = {Fundamenta Informaticae},
    volume = {102},
    number = {1},
    pages = {97--113},
    publisher = {IOS Press},
    issn = {0169-2968},
    doi = {10.3233/FI-2010-299},
}

@article{DunAnhSza:2010:345778,
    author = {Barbara Dunin-Keplicz and Linh Anh Nguyen and Andrzej Szalas},
    title = {{A Framework for Graded Beliefs, Goals and Intentions}},
    year = {2010},
    journal = {Fundamenta Informaticae},
    volume = {100},
    number = {1-4},
    pages = {53--76},
    publisher = {IOS Press},
    issn = {0169-2968},
    doi = {10.3233/FI-2010-263},
}

@article{DunNguSza:2010:337938,
    author = {Barbara Dunin-Keplicz and Linh Anh Nguyen and Andrzej Szalas},
    title = {{A Layered Rule-Based Architecture for Approximate Knowledge Fusion}},
    year = {2010},
    journal = {COMPUTER SCIENCE AND INFORMATION SYSTEMS},
    volume = {7},
    number = {3},
    pages = {617--642},
    publisher = {COMSIS CONSORTIUM},
    issn = {1820-0214},
    doi = {10.2298/CSIS100209015D},
}

@article{DunAnhSza:2010:308420,
    author = {Barbara Dunin-Keplicz and Linh Anh Nguyen and Andrzej Szalas},
    title = {{Tractable approximate knowledge fusion using the Horn fragment of serial propositional dynamic logic}},
    year = {2010},
    journal = {International Journal of Approximate Reasoning},
    volume = {51},
    number = {3},
    pages = {346--362},
    publisher = {Elsevier},
    issn = {0888-613X},
    doi = {10.1016/j.ijar.2009.11.002},
}

@article{GabSza:2009:400675,
    author = {Dov Gabbay and Andrzej Szalas},
    title = {{Annotation Theories over Finite Graphs}},
    year = {2009},
    journal = {Studia Logica: An International Journal for Symbolic Logic},
    volume = {93},
    number = {2-3},
    pages = {147--180},
    publisher = {Springer},
    issn = {0039-3215},
    doi = {10.1007/s11225-009-9220-3},
}

@article{SzaGab:2009:242260,
    author = {Andrzej Szalas and Dov Gabbay},
    title = {{Voting by Eliminating Quantifiers}},
    year = {2009},
    journal = {Studia Logica: An International Journal for Symbolic Logic},
    volume = {92},
    number = {3},
    pages = {365--379},
    publisher = {Springer},
    issn = {0039-3215},
    doi = {10.1007/s11225-009-9200-7},
}

@article{Sza:2008:265495,
    author = {Andrzej Szalas},
    title = {{Towards Incorporating Background Theories into Quantifier Elimination}},
    year = {2008},
    journal = {Journal of applied non-classical logics},
    volume = {18},
    number = {2-3},
    pages = {325--340},
    publisher = {\'Editions Herm\`es-Lavoisier},
    issn = {1166-3081},
    doi = {10.3166/jancl.18.325-340},
}

@article{DohLukSza:2007:270913,
    author = {Patrick Doherty and Witold Lukaszewicz and Andrzej Szalas},
    title = {{Communication between agents with heterogeneous perceptual capabilities}},
    year = {2007},
    journal = {Information Fusion},
    volume = {8},
    number = {1},
    pages = {56--69},
    publisher = {Elsevier},
    issn = {1566-2535},
    doi = {10.1016/j.inffus.2005.05.006},
}

@article{GabSza:2007:269262,
    author = {D.M. Gabbay and Andrzej Szalas},
    title = {{Second-order quantifier elimination in higher-order contexts with applications to the semantical analysis of conditionals}},
    year = {2007},
    journal = {Studia Logica: An International Journal for Symbolic Logic},
    volume = {87},
    number = {1},
    pages = {37--50},
    publisher = {Springer},
    issn = {0039-3215},
    doi = {10.1007/s11225-007-9075-4},
}

@article{DohSza:2007:268924,
    author = {Patrick Doherty and Andrzej Szalas},
    title = {{A correspondence framework between three-valued logics and similarity-based approximate reasoning}},
    year = {2007},
    journal = {Fundamenta Informaticae},
    volume = {75},
    number = {1-4},
    pages = {179--193},
    publisher = {IOS Press},
    issn = {0169-2968},
}

@article{Sza:2006:257649,
    author = {Andrzej Szalas},
    title = {{Second-order Reasoning in Description Logics}},
    year = {2006},
    journal = {Journal of applied non-classical logics},
    volume = {16},
    number = {3 - 4},
    pages = {517--530},
    publisher = {\'Editions Herm\`es-Lavoisier},
    issn = {1166-3081},
    doi = {10.3166/jancl.16.517-530},
}

@article{DohMagSza:2006:252615,
    author = {Patrick Doherty and Martin Magnusson and Andrzej Szalas},
    title = {{Approximate Databases: A support tool for approximate reasoning}},
    year = {2006},
    journal = {Journal of applied non-classical logics},
    volume = {16},
    number = {1-2},
    pages = {87--118},
    publisher = {\'Editions Herm\`es-Lavoisier},
    issn = {1166-3081},
    doi = {10.3166/jancl.16.87-117},
    note = {Special issue on implementation of logics},
}

@article{DohSkoEtAl:2003:269316,
    author = {Patrick Doherty and Andrew Skowron and Witold Lukaszewicz and Andrzej Szalas},
    title = {{Preface}},
    year = {2003},
    journal = {Fundamenta Informaticae},
    volume = {57},
    number = {2-4},
    pages = {i--iii},
    publisher = {IOS Press},
    issn = {0169-2968},
}

@article{DohGraEtAl:2003:269311,
    author = {Patrick Doherty and M Grabowski and Witold Lukaszewicz and Andrzej Szalas},
    title = {{Towards a framework for approximate ontologies}},
    year = {2003},
    journal = {Fundamenta Informaticae},
    volume = {57},
    number = {2-4},
    pages = {147--165},
    publisher = {IOS Press},
    issn = {0169-2968},
}

@article{DohKacSza:1999:262472,
    author = {Patrick Doherty and Jaroslaw Kachniarz and Andrzej Szalas},
    title = {{Meta-queries on deductive databases}},
    year = {1999},
    journal = {Fundamenta Informaticae},
    volume = {40},
    number = {1},
    pages = {17--30},
    publisher = {IOS Press},
    issn = {0169-2968},
    doi = {10.3233/FI-1999-40102},
}

@article{DohLukSza:1999:262470,
    author = {Patrick Doherty and Witold Lukaszewicz and Andrzej Szalas},
    title = {{Declarative PTIME queries for relational databases using quantifier elimination}},
    year = {1999},
    journal = {Journal of logic and computation (Print)},
    volume = {9},
    number = {5},
    pages = {737--758},
    publisher = {Oxford University Press},
    issn = {0955-792X},
    doi = {10.1093/logcom/9.5.737},
}

@article{DohLukSza:1998:262471,
    author = {Patrick Doherty and Witold Lukaszewicz and Andrzej Szalas},
    title = {{General domain circumscription and its effective reductions}},
    year = {1998},
    journal = {Fundamenta Informaticae},
    volume = {36},
    number = {1},
    pages = {23--55},
    publisher = {IOS Press},
    issn = {0169-2968},
    doi = {10.3233/FI-1998-3612},
}

@article{DohLukSza:1997:262477,
    author = {Patrick Doherty and Witold Lukaszewicz and Andrzej Szalas},
    title = {{Computing circumscription revisited: A reduction algorithm}},
    year = {1997},
    journal = {Journal of automated reasoning},
    volume = {18},
    number = {3},
    pages = {297--336},
    publisher = {Kluwer Academic Publishers},
    issn = {0168-7433},
    doi = {10.1023/A:1005722130532},
}

@article{Sza:1996:499794,
    author = {Andrzej Szalas},
    title = {{On Natural Deduction in First-Order Fixpoint Logics}},
    year = {1996},
    journal = {Fundamenta Informaticae},
    volume = {26},
    number = {1},
    pages = {81--94},
    publisher = {IOS Press},
    issn = {0169-2968},
    doi = {10.3233/FI-1996-2616},
}

@article{DohLukSza:1996:262475,
    author = {Patrick Doherty and Witold Lukaszewicz and Andrzej Szalas},
    title = {{A reduction result for circumscribed semi-horn formulas}},
    year = {1996},
    journal = {Fundamenta Informaticae},
    volume = {28},
    number = {3,4},
    pages = {261--272},
    publisher = {IOS Press},
    issn = {0169-2968},
    doi = {10.3233/FI-1996-283404},
}

@article{Sza:1994:499789,
    author = {Andrzej Szalas},
    title = {{On an Automated Translation of Modal Proof Rules into Formulas of the Classical Logic}},
    year = {1994},
    journal = {Journal of Applied Non-Classical Logics},
    volume = {4},
    number = {2},
    pages = {119--127},
    publisher = {\'Editions Herm\`es-Lavoisier},
    issn = {1166-3081},
}

@article{Sza:1993:499797,
    author = {Andrzej Szalas},
    title = {{On the Correspondence between Modal and Classical Logic: An Automated Approach}},
    year = {1993},
    journal = {Journal of logic and computation (Print)},
    volume = {3},
    number = {6},
    pages = {605--620},
    publisher = {Oxford University Press},
    issn = {0955-792X},
    doi = {10.1093/logcom/3.6.605},
}

@article{Sza:1992:499795,
    author = {Andrzej Szalas},
    title = {{Axiomatizing Fixpoint Logics}},
    year = {1992},
    journal = {Information Processing Letters},
    volume = {41},
    number = {4},
    pages = {175--180},
    publisher = {Elsevier},
    issn = {0020-0190},
    doi = {10.1016/0020-0190(92)90175-U},
}

@article{Sza:1991:499807,
    author = {Andrzej Szalas},
    title = {{On Strictly Arithmetical Completeness in Logics of Programs}},
    year = {1991},
    journal = {Theoretical Computer Science},
    volume = {79},
    number = {2},
    pages = {341--355},
    publisher = {Elsevier},
    issn = {0304-3975},
    doi = {10.1016/0304-3975(91)90336-Z},
}

@article{PetSza:1989:499723,
    author = {Uwe Petermann and Andrzej Szalas},
    title = {{On Temporal Logic for Distributed Systems and its Application to Processes Communicating by Interrupts}},
    year = {1989},
    journal = {Fundamenta Informaticae},
    volume = {12},
    number = {2},
    pages = {191--204},
    publisher = {IOS Press},
    issn = {0169-2968},
}

@article{Sza:1988:499818,
    author = {Andrzej Szalas},
    title = {{Towards the Temporal Approach to Abstract Data Types}},
    year = {1988},
    journal = {Fundamenta Informaticae},
    volume = {11},
    number = {1},
    pages = {49--64},
    publisher = {IOS Press},
    issn = {0169-2968},
}

@article{Sza:1988:499799,
    author = {Andrzej Szalas},
    title = {{An Incompleteness Result in Process Algebra}},
    year = {1988},
    journal = {Information Processing Letters},
    volume = {29},
    number = {2},
    pages = {67--70},
    publisher = {Elsevier},
    issn = {0020-0190},
    doi = {10.1016/0020-0190(88)90030-0},
}

@article{HolSza:1988:499750,
    author = {Leszek Holenderski and Andrzej Szalas},
    title = {{Propositional Description of Finite Cause-Effect Structures}},
    year = {1988},
    journal = {Information Processing Letters},
    volume = {27},
    number = {3},
    pages = {111--117},
    publisher = {Elsevier},
    issn = {0020-0190},
    doi = {10.1016/0020-0190(88)90064-6},
}

@article{SzaHol:1988:499746,
    author = {Andrzej Szalas and Leszek Holenderski},
    title = {{Incompleteness of First-Order Temporal Logic with Until}},
    year = {1988},
    journal = {Theoretical Computer Science},
    volume = {57},
    number = {2-3},
    pages = {317--325},
    publisher = {Elsevier},
    issn = {0304-3975},
    doi = {10.1016/0304-3975(88)90045-X},
}

@article{Sza:1987:499822,
    author = {Andrzej Szalas},
    title = {{A Complete Axiomatic Characterization of First-Order Temporal Logic of Linear Time}},
    year = {1987},
    journal = {Theoretical Computer Science},
    volume = {54},
    number = {2-3},
    pages = {199--214},
    publisher = {Elsevier},
    issn = {0304-3975},
    doi = {10.1016/0304-3975(87)90129-0},
}

@article{Sza:1987:499817,
    author = {Andrzej Szalas},
    title = {{Arithmetical Axiomatization of First-Order Temporal Logic}},
    year = {1987},
    journal = {Information Processing Letters},
    volume = {26},
    number = {3},
    pages = {111--116},
    publisher = {Elsevier},
    issn = {0020-0190},
    doi = {10.1016/0020-0190(87)90047-0},
}

@article{Sza:1986:499709,
    author = {Andrzej Szalas},
    title = {{Concerning the Semantic Consequence Relation in First-Order Temporal Logic}},
    year = {1986},
    journal = {Theoretical Computer Science},
    volume = {47},
    number = {3},
    pages = {329--334},
    publisher = {Elsevier},
    issn = {0304-3975},
    doi = {10.1016/0304-3975(86)90157-X},
}

@article{PetSza:1985:499721,
    author = {Uwe Petermann and Andrzej Szalas},
    title = {{A Note on PCI: Distributed Processes Communicating by Interrupts}},
    year = {1985},
    journal = {SIGPLAN notices},
    volume = {20},
    number = {3},
    pages = {37--46},
    publisher = {ACM Press},
    issn = {0362-1340},
    doi = {10.1145/382284.382390},
}

@article{SzaSzc:1985:499714,
    author = {Andrzej Szalas and Danuta Szczepaska},
    title = {{Exception Handling in Parallel Computations}},
    year = {1985},
    journal = {SIGPLAN notices},
    volume = {20},
    number = {10},
    pages = {95--104},
    publisher = {ACM Press},
    issn = {0362-1340},
    doi = {10.1145/382286.382385},
}

@article{Sza:1984:499704,
    author = {Andrzej Szalas},
    title = {{On an Application of Algorithmic Theory of Stacks}},
    year = {1984},
    journal = {Fundamenta Informaticae},
    volume = {7},
    number = {3},
    pages = {378--388},
    publisher = {IOS Press},
    issn = {0169-2968},
}

@article{Sza:1981:499698,
    author = {Andrzej Szalas},
    title = {{Algorithmic Logic with Recursive Functions}},
    year = {1981},
    journal = {Fundamenta Informaticae},
    volume = {4},
    number = {4},
    pages = {975--995},
    publisher = {IOS Press},
    issn = {0169-2968},
}