Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "modal satisfiability"
download as .bib file
@inproceedings{DBLP:conf/csl/Jaakkola23,
author = {Reijo Jaakkola},
editor = {Bartek Klin and
Elaine Pimentel},
title = {Complexity of Polyadic Boolean Modal Logics: Model Checking and Satisfiability},
booktitle = {31st {EACSL} Annual Conference on Computer Science Logic, {CSL} 2023,
February 13-16, 2023, Warsaw, Poland},
series = {LIPIcs},
volume = {252},
pages = {26:1--26:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.CSL.2023.26},
doi = {10.4230/LIPICS.CSL.2023.26},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/csl/Jaakkola23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2210-01034,
author = {Reijo Jaakkola},
title = {Complexity of Polyadic Boolean Modal Logics: Model Checking and Satisfiability},
journal = {CoRR},
volume = {abs/2210.01034},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2210.01034},
doi = {10.48550/ARXIV.2210.01034},
eprinttype = {arXiv},
eprint = {2210.01034},
timestamp = {Fri, 07 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2210-01034.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tplp/AlvianoBB21,
author = {Mario Alviano and
Sotiris Batsakis and
George Baryannis},
title = {Modal Logic {S5} Satisfiability in Answer Set Programming},
journal = {Theory Pract. Log. Program.},
volume = {21},
number = {5},
pages = {527--542},
year = {2021},
url = {https://doi.org/10.1017/S1471068421000247},
doi = {10.1017/S1471068421000247},
timestamp = {Wed, 15 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tplp/AlvianoBB21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tableaux/GoreK21,
author = {Rajeev Gor{\'{e}} and
Cormac Kikkert},
editor = {Anupam Das and
Sara Negri},
title = {CEGAR-Tableaux: Improved Modal Satisfiability via Modal Clause-Learning
and {SAT}},
booktitle = {Automated Reasoning with Analytic Tableaux and Related Methods - 30th
International Conference, {TABLEAUX} 2021, Birmingham, UK, September
6-9, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12842},
pages = {74--91},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-86059-2\_5},
doi = {10.1007/978-3-030-86059-2\_5},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/tableaux/GoreK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:series/faia/SebastianiT21,
author = {Roberto Sebastiani and
Armando Tacchella},
editor = {Armin Biere and
Marijn Heule and
Hans van Maaren and
Toby Walsh},
title = {{SAT} Techniques for Modal and Description Logics},
booktitle = {Handbook of Satisfiability - Second Edition},
series = {Frontiers in Artificial Intelligence and Applications},
volume = {336},
pages = {1223--1266},
publisher = {{IOS} Press},
year = {2021},
url = {https://doi.org/10.3233/FAIA201016},
doi = {10.3233/FAIA201016},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/series/faia/SebastianiT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2108-04194,
author = {Mario Alviano and
Sotiris Batsakis and
George Baryannis},
title = {Modal Logic {S5} Satisfiability in Answer Set Programming},
journal = {CoRR},
volume = {abs/2108.04194},
year = {2021},
url = {https://arxiv.org/abs/2108.04194},
eprinttype = {arXiv},
eprint = {2108.04194},
timestamp = {Wed, 11 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2108-04194.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tocl/HellaKMV20,
author = {Lauri Hella and
Antti Kuusisto and
Arne Meier and
Heribert Vollmer},
title = {Satisfiability of Modal Inclusion Logic: Lax and Strict Semantics},
journal = {{ACM} Trans. Comput. Log.},
volume = {21},
number = {1},
pages = {7:1--7:18},
year = {2020},
url = {https://doi.org/10.1145/3356043},
doi = {10.1145/3356043},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tocl/HellaKMV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sac/Salhi20,
author = {Yakoub Salhi},
editor = {Chih{-}Cheng Hung and
Tom{\'{a}}s Cern{\'{y}} and
Dongwan Shin and
Alessio Bechini},
title = {On satisfiability problem in modal logic {S5}},
booktitle = {{SAC} '20: The 35th {ACM/SIGAPP} Symposium on Applied Computing, online
event, [Brno, Czech Republic], March 30 - April 3, 2020},
pages = {948--955},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3341105.3373940},
doi = {10.1145/3341105.3373940},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sac/Salhi20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/HuangLWZM019,
author = {Pei Huang and
Minghao Liu and
Ping Wang and
Wenhui Zhang and
Feifei Ma and
Jian Zhang},
editor = {Sarit Kraus},
title = {Solving the Satisfiability Problem of Modal Logic {S5} Guided by Graph
Coloring},
booktitle = {Proceedings of the Twenty-Eighth International Joint Conference on
Artificial Intelligence, {IJCAI} 2019, Macao, China, August 10-16,
2019},
pages = {1093--1100},
publisher = {ijcai.org},
year = {2019},
url = {https://doi.org/10.24963/ijcai.2019/153},
doi = {10.24963/IJCAI.2019/153},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/HuangLWZM019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/hal/Montmirail18,
author = {Valentin Montmirail},
title = {Practical resolution of satisfiability testing for modal logics. (R{\'{e}}solution
pratique du test de coh{\'{e}}rence en logiques modales)},
school = {Artois University, Arras, France},
year = {2018},
url = {https://tel.archives-ouvertes.fr/tel-02886382},
timestamp = {Mon, 28 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/hal/Montmirail18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fuin/MichaliszynOW18,
author = {Jakub Michaliszyn and
Jan Otop and
Piotr Witkowski},
title = {Satisfiability versus Finite Satisfiability in Elementary Modal Logics},
journal = {Fundam. Informaticae},
volume = {163},
number = {2},
pages = {165--188},
year = {2018},
url = {https://doi.org/10.3233/FI-2018-1736},
doi = {10.3233/FI-2018-1736},
timestamp = {Fri, 18 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/fuin/MichaliszynOW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/CaridroitLBLM17,
author = {Thomas Caridroit and
Jean{-}Marie Lagniez and
Daniel Le Berre and
Tiago de Lima and
Valentin Montmirail},
editor = {Satinder Singh and
Shaul Markovitch},
title = {A SAT-Based Approach for Solving the Modal Logic S5-Satisfiability
Problem},
booktitle = {Proceedings of the Thirty-First {AAAI} Conference on Artificial Intelligence,
February 4-9, 2017, San Francisco, California, {USA}},
pages = {3864--3870},
publisher = {{AAAI} Press},
year = {2017},
url = {https://doi.org/10.1609/aaai.v31i1.11128},
doi = {10.1609/AAAI.V31I1.11128},
timestamp = {Mon, 04 Sep 2023 14:40:32 +0200},
biburl = {https://dblp.org/rec/conf/aaai/CaridroitLBLM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cogsci/Kowalski17,
author = {Robert A. Kowalski},
editor = {Claudia Schon and
Ulrich Furbach},
title = {Satisfiability for First-order Logic as a Non-Modal Deontic Logic},
booktitle = {Proceedings of the Workshop on Bridging the Gap between Human and
Automated Reasoning - Is Logic and Automated Reasoning a Foundation
for Human Reasoning? co-located with 39th Annual Meeting of the Cognitive
Science Society (CogSci 2017), London, UK, July 26, 2017},
series = {{CEUR} Workshop Proceedings},
volume = {1994},
pages = {84--90},
publisher = {CEUR-WS.org},
year = {2017},
url = {https://ceur-ws.org/Vol-1994/Bridging2017\_paper8.pdf},
timestamp = {Fri, 10 Mar 2023 16:23:19 +0100},
biburl = {https://dblp.org/rec/conf/cogsci/Kowalski17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/LagniezBLM17,
author = {Jean{-}Marie Lagniez and
Daniel Le Berre and
Tiago de Lima and
Valentin Montmirail},
editor = {Carles Sierra},
title = {A Recursive Shortcut for {CEGAR:} Application To The Modal Logic {K}
Satisfiability Problem},
booktitle = {Proceedings of the Twenty-Sixth International Joint Conference on
Artificial Intelligence, {IJCAI} 2017, Melbourne, Australia, August
19-25, 2017},
pages = {674--680},
publisher = {ijcai.org},
year = {2017},
url = {https://doi.org/10.24963/ijcai.2017/94},
doi = {10.24963/IJCAI.2017/94},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/LagniezBLM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/birthday/ArecesFM15,
author = {Carlos Areces and
Pascal Fontaine and
Stephan Merz},
editor = {Rocco De Nicola and
Rolf Hennicker},
title = {Modal Satisfiability via {SMT} Solving},
booktitle = {Software, Services, and Systems - Essays Dedicated to Martin Wirsing
on the Occasion of His Retirement from the Chair of Programming and
Software Engineering},
series = {Lecture Notes in Computer Science},
volume = {8950},
pages = {30--45},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-15545-6\_5},
doi = {10.1007/978-3-319-15545-6\_5},
timestamp = {Tue, 14 May 2019 10:00:52 +0200},
biburl = {https://dblp.org/rec/conf/birthday/ArecesFM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/HellaKMV15,
author = {Lauri Hella and
Antti Kuusisto and
Arne Meier and
Heribert Vollmer},
title = {Satisfiability of Modal Inclusion Logic: Lax and Strict Semantics},
journal = {CoRR},
volume = {abs/1504.06409},
year = {2015},
url = {http://arxiv.org/abs/1504.06409},
eprinttype = {arXiv},
eprint = {1504.06409},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/HellaKMV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aiml/GorankoV14,
author = {Valentin Goranko and
Steen Vester},
editor = {Rajeev Gor{\'{e}} and
Barteld P. Kooi and
Agi Kurucz},
title = {Optimal Decision Procedures for Satisfiability in Fragments of Alternating-time
Temporal Logics},
booktitle = {Advances in Modal Logic 10, invited and contributed papers from the
tenth conference on "Advances in Modal Logic," held in Groningen,
The Netherlands, August 5-8, 2014},
pages = {234--253},
publisher = {College Publications},
year = {2014},
url = {http://www.aiml.net/volumes/volume10/Goranko-Vester.pdf},
timestamp = {Tue, 16 Jan 2024 17:18:03 +0100},
biburl = {https://dblp.org/rec/conf/aiml/GorankoV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AminofMR14,
author = {Benjamin Aminof and
Aniello Murano and
Sasha Rubin},
title = {Satisfiability and Model Checking of CTL* with Graded Path Modalities},
journal = {CoRR},
volume = {abs/1410.7551},
year = {2014},
url = {http://arxiv.org/abs/1410.7551},
eprinttype = {arXiv},
eprint = {1410.7551},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AminofMR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/SebastianiV14,
author = {Roberto Sebastiani and
Michele Vescovi},
title = {Automated Reasoning in Modal and Description Logics via {SAT} Encoding:
the Case Study of K(m)/ALC-Satisfiability},
journal = {CoRR},
volume = {abs/1401.3463},
year = {2014},
url = {http://arxiv.org/abs/1401.3463},
eprinttype = {arXiv},
eprint = {1401.3463},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/SebastianiV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fuin/CantoneA13,
author = {Domenico Cantone and
Marianna Nicolosi Asmundo},
title = {On the Satisfiability Problem for a 4-level Quantified Syllogistic
and Some Applications to Modal Logic},
journal = {Fundam. Informaticae},
volume = {124},
number = {4},
pages = {427--448},
year = {2013},
url = {https://doi.org/10.3233/FI-2013-842},
doi = {10.3233/FI-2013-842},
timestamp = {Fri, 18 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/fuin/CantoneA13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZawidzkiST13,
author = {Michal Zawidzki and
Renate A. Schmidt and
Dmitry Tishkovsky},
title = {Satisfiability problem for modal logic with global counting operators
coded in binary is NExpTime-complete},
journal = {Inf. Process. Lett.},
volume = {113},
number = {1-2},
pages = {34--38},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2012.09.007},
doi = {10.1016/J.IPL.2012.09.007},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ZawidzkiST13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tocl/Praveen13,
author = {M. Praveen},
title = {Does Treewidth Help in Modal Satisfiability?},
journal = {{ACM} Trans. Comput. Log.},
volume = {14},
number = {3},
pages = {18:1--18:32},
year = {2013},
url = {https://doi.org/10.1145/2499937.2499939},
doi = {10.1145/2499937.2499939},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tocl/Praveen13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AchilleosLM12,
author = {Antonis Achilleos and
Michael Lampis and
Valia Mitsou},
title = {Parameterized Modal Satisfiability},
journal = {Algorithmica},
volume = {64},
number = {1},
pages = {38--55},
year = {2012},
url = {https://doi.org/10.1007/s00453-011-9552-z},
doi = {10.1007/S00453-011-9552-Z},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AchilleosLM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aiml/MichaliszynK12,
author = {Jakub Michaliszyn and
Emanuel Kieronski},
editor = {Thomas Bolander and
Torben Bra{\"{u}}ner and
Silvio Ghilardi and
Lawrence S. Moss},
title = {Finite Satisfiability of Modal Logic over Horn{\textasciitilde}Definable
Classes of Frames},
booktitle = {Advances in Modal Logic 9, papers from the ninth conference on "Advances
in Modal Logic," held in Copenhagen, Denmark, 22-25 August 2012},
pages = {464--482},
publisher = {College Publications},
year = {2012},
url = {http://www.aiml.net/volumes/volume9/Michaliszyn-Kieronski.pdf},
timestamp = {Wed, 17 Jan 2024 09:57:06 +0100},
biburl = {https://dblp.org/rec/conf/aiml/MichaliszynK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isipers/SalhiJS12,
author = {Yakoub Salhi and
Sa{\"{\i}}d Jabbour and
Lakhdar Sais},
editor = {Yuzuru Tanaka and
Nicolas Spyratos and
Tetsuya Yoshida and
Carlo Meghini},
title = {Graded Modal Logic {GS5} and Itemset Support Satisfiability},
booktitle = {Information Search, Integration and Personalization - International
Workshop, {ISIP} 2012, Sapporo, Japan, October 11-13, 2012. Revised
Selected Papers},
series = {Communications in Computer and Information Science},
volume = {146},
pages = {131--140},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-40140-4\_14},
doi = {10.1007/978-3-642-40140-4\_14},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isipers/SalhiJS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:journals/corr/abs-1210-2481,
author = {Jakub Michaliszyn and
Jan Otop and
Piotr Witkowski},
editor = {Marco Faella and
Aniello Murano},
title = {Satisfiability vs. Finite Satisfiability in Elementary Modal Logics},
booktitle = {Proceedings Third International Symposium on Games, Automata, Logics
and Formal Verification, GandALF 2012, Napoli, Italy, September 6-8,
2012},
series = {{EPTCS}},
volume = {96},
pages = {141--154},
year = {2012},
url = {https://doi.org/10.4204/EPTCS.96.11},
doi = {10.4204/EPTCS.96.11},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1210-2481.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1209-1943,
author = {Domenico Cantone and
Marianna Nicolosi Asmundo},
title = {On the satisfiability problem for a 4-level quantified syllogistic
and some applications to modal logic (extended version)},
journal = {CoRR},
volume = {abs/1209.1943},
year = {2012},
url = {http://arxiv.org/abs/1209.1943},
eprinttype = {arXiv},
eprint = {1209.1943},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1209-1943.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cilc/CantoneA11,
author = {Domenico Cantone and
Marianna Nicolosi Asmundo},
editor = {Fabio Fioravanti},
title = {On the satisfiability problem for a 4-level quantified syllogistic
and some applications to modal logic},
booktitle = {Proceedings of the 26th Italian Conference on Computational Logic,
Pescara, Italy, August 31 - September 2, 2011},
series = {{CEUR} Workshop Proceedings},
volume = {810},
pages = {73--97},
publisher = {CEUR-WS.org},
year = {2011},
url = {https://ceur-ws.org/Vol-810/paper-l05.pdf},
timestamp = {Fri, 10 Mar 2023 16:22:46 +0100},
biburl = {https://dblp.org/rec/conf/cilc/CantoneA11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/HemaspaandraSS10,
author = {Edith Hemaspaandra and
Henning Schnoor and
Ilka Schnoor},
title = {Generalized modal satisfiability},
journal = {J. Comput. Syst. Sci.},
volume = {76},
number = {7},
pages = {561--578},
year = {2010},
url = {https://doi.org/10.1016/j.jcss.2009.10.011},
doi = {10.1016/J.JCSS.2009.10.011},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/HemaspaandraSS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AchilleosLM10,
author = {Antonis Achilleos and
Michael Lampis and
Valia Mitsou},
editor = {Samson Abramsky and
Cyril Gavoille and
Claude Kirchner and
Friedhelm Meyer auf der Heide and
Paul G. Spirakis},
title = {Parameterized Modal Satisfiability},
booktitle = {Automata, Languages and Programming, 37th International Colloquium,
{ICALP} 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part
{II}},
series = {Lecture Notes in Computer Science},
volume = {6199},
pages = {369--380},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-14162-1\_31},
doi = {10.1007/978-3-642-14162-1\_31},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/AchilleosLM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Praveen10,
author = {M. Praveen},
editor = {Petr Hlinen{\'{y}} and
Anton{\'{\i}}n Kucera},
title = {Does Treewidth Help in Modal Satisfiability? - (Extended Abstract)},
booktitle = {Mathematical Foundations of Computer Science 2010, 35th International
Symposium, {MFCS} 2010, Brno, Czech Republic, August 23-27, 2010.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6281},
pages = {580--591},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-15155-2\_51},
doi = {10.1007/978-3-642-15155-2\_51},
timestamp = {Fri, 30 Aug 2019 10:02:28 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Praveen10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1006-2461,
author = {M. Praveen},
title = {Does Treewidth Help in Modal Satisfiability?},
journal = {CoRR},
volume = {abs/1006.2461},
year = {2010},
url = {http://arxiv.org/abs/1006.2461},
eprinttype = {arXiv},
eprint = {1006.2461},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1006-2461.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jair/SebastianiV09,
author = {Roberto Sebastiani and
Michele Vescovi},
title = {Automated Reasoning in Modal and Description Logics via {SAT} Encoding:
the Case Study of K(m)/ALC-Satisfiability},
journal = {J. Artif. Intell. Res.},
volume = {35},
pages = {343--389},
year = {2009},
url = {https://doi.org/10.1613/jair.2675},
doi = {10.1613/JAIR.2675},
timestamp = {Mon, 21 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jair/SebastianiV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/KazakovP09,
author = {Yevgeny Kazakov and
Ian Pratt{-}Hartmann},
title = {A Note on the Complexity of the Satisfiability Problem for Graded
Modal Logics},
booktitle = {Proceedings of the 24th Annual {IEEE} Symposium on Logic in Computer
Science, {LICS} 2009, 11-14 August 2009, Los Angeles, CA, {USA}},
pages = {407--416},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/LICS.2009.17},
doi = {10.1109/LICS.2009.17},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lics/KazakovP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:series/faia/SebastianiT09,
author = {Roberto Sebastiani and
Armando Tacchella},
editor = {Armin Biere and
Marijn Heule and
Hans van Maaren and
Toby Walsh},
title = {{SAT} Techniques for Modal and Description Logics},
booktitle = {Handbook of Satisfiability},
series = {Frontiers in Artificial Intelligence and Applications},
volume = {185},
pages = {781--824},
publisher = {{IOS} Press},
year = {2009},
url = {https://doi.org/10.3233/978-1-58603-929-5-781},
doi = {10.3233/978-1-58603-929-5-781},
timestamp = {Fri, 06 May 2022 08:00:40 +0200},
biburl = {https://dblp.org/rec/series/faia/SebastianiT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0905-3108,
author = {Yevgeny Kazakov and
Ian Pratt{-}Hartmann},
title = {A Note on the Complexity of the Satisfiability Problem for Graded
Modal Logics},
journal = {CoRR},
volume = {abs/0905.3108},
year = {2009},
url = {http://arxiv.org/abs/0905.3108},
eprinttype = {arXiv},
eprint = {0905.3108},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0905-3108.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0912-4941,
author = {Antonis Achilleos and
Michael Lampis and
Valia Mitsou},
title = {Parameterized Modal Satisfiability},
journal = {CoRR},
volume = {abs/0912.4941},
year = {2009},
url = {http://arxiv.org/abs/0912.4941},
eprinttype = {arXiv},
eprint = {0912.4941},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0912-4941.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0804-2729,
author = {Edith Hemaspaandra and
Henning Schnoor and
Ilka Schnoor},
title = {Generalized Modal Satisfiability},
journal = {CoRR},
volume = {abs/0804.2729},
year = {2008},
url = {http://arxiv.org/abs/0804.2729},
eprinttype = {arXiv},
eprint = {0804.2729},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0804-2729.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/logcom/HalpernR07,
author = {Joseph Y. Halpern and
Leandro Chaves R{\^{e}}go},
title = {Characterizing the {NP-PSPACE} Gap in the Satisfiability Problem for
Modal Logic},
journal = {J. Log. Comput.},
volume = {17},
number = {4},
pages = {795--806},
year = {2007},
url = {https://doi.org/10.1093/logcom/exm029},
doi = {10.1093/LOGCOM/EXM029},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/logcom/HalpernR07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/HalpernR07,
author = {Joseph Y. Halpern and
Leandro Chaves R{\^{e}}go},
editor = {Manuela M. Veloso},
title = {Characterizing the {NP-PSPACE} Gap in the Satisfiability Problem for
Modal Logic},
booktitle = {{IJCAI} 2007, Proceedings of the 20th International Joint Conference
on Artificial Intelligence, Hyderabad, India, January 6-12, 2007},
pages = {2306--2311},
year = {2007},
url = {http://ijcai.org/Proceedings/07/Papers/371.pdf},
timestamp = {Tue, 20 Aug 2019 16:17:11 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/HalpernR07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/SebastianiV06,
author = {Roberto Sebastiani and
Michele Vescovi},
editor = {Armin Biere and
Carla P. Gomes},
title = {Encoding the Satisfiability of Modal and Description Logics into {SAT:}
The Case Study of K(m)/ALC},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2006, 9th
International Conference, Seattle, WA, USA, August 12-15, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4121},
pages = {130--135},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11814948\_15},
doi = {10.1007/11814948\_15},
timestamp = {Tue, 14 May 2019 10:00:41 +0200},
biburl = {https://dblp.org/rec/conf/sat/SebastianiV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BaulandHSS06,
author = {Michael Bauland and
Edith Hemaspaandra and
Henning Schnoor and
Ilka Schnoor},
editor = {Bruno Durand and
Wolfgang Thomas},
title = {Generalized Modal Satisfiability},
booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer
Science, Marseille, France, February 23-25, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3884},
pages = {500--511},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11672142\_41},
doi = {10.1007/11672142\_41},
timestamp = {Wed, 19 May 2021 12:05:43 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BaulandHSS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0603019,
author = {Joseph Y. Halpern and
Leandro Chaves R{\^{e}}go},
title = {Characterizing the {NP-PSPACE} Gap in the Satisfiability Problem for
Modal Logic},
journal = {CoRR},
volume = {abs/cs/0603019},
year = {2006},
url = {http://arxiv.org/abs/cs/0603019},
eprinttype = {arXiv},
eprint = {cs/0603019},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0603019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0412101,
author = {Franz Baader and
Stephan Tobies},
title = {The Inverse Method Implements the Automata Approach for Modal Satisfiability},
journal = {CoRR},
volume = {abs/cs/0412101},
year = {2004},
url = {http://arxiv.org/abs/cs/0412101},
eprinttype = {arXiv},
eprint = {cs/0412101},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0412101.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csclp/BrandGR03,
author = {Sebastian Brand and
Rosella Gennari and
Maarten de Rijke},
editor = {Krzysztof R. Apt and
Fran{\c{c}}ois Fages and
Francesca Rossi and
P{\'{e}}ter Szeredi and
J{\'{o}}zsef V{\'{a}}ncza},
title = {Constraint Methods for Modal Satisfiability},
booktitle = {Recent Advances in Constraints, Joint ERCIM/CoLogNET International
Workshop on Constraint Solving and Constraint Logic Programming, {CSCLP}
2003, Budapest, Hungary, June 30 - July 2, 2003, Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {3010},
pages = {66--86},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-24662-6\_4},
doi = {10.1007/978-3-540-24662-6\_4},
timestamp = {Tue, 23 Jan 2024 13:25:46 +0100},
biburl = {https://dblp.org/rec/conf/csclp/BrandGR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/LodingR03,
author = {Christof L{\"{o}}ding and
Philipp Rohde},
editor = {Paritosh K. Pandya and
Jaikumar Radhakrishnan},
title = {Model Checking and Satisfiability for Sabotage Modal Logic},
booktitle = {{FST} {TCS} 2003: Foundations of Software Technology and Theoretical
Computer Science, 23rd Conference, Mumbai, India, December 15-17,
2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2914},
pages = {302--313},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-24597-1\_26},
doi = {10.1007/978-3-540-24597-1\_26},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/LodingR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jar/HorrocksP02,
author = {Ian Horrocks and
Peter F. Patel{-}Schneider},
title = {Evaluating Optimized Decision Procedures for Propositional Modal K(m)
Satisfiability},
journal = {J. Autom. Reason.},
volume = {28},
number = {2},
pages = {173--204},
year = {2002},
url = {https://doi.org/10.1023/A:1015063215934},
doi = {10.1023/A:1015063215934},
timestamp = {Tue, 12 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jar/HorrocksP02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jar/HustadtS02,
author = {Ullrich Hustadt and
Renate A. Schmidt},
title = {Using Resolution for Testing Modal Satisfiability and Building Models},
journal = {J. Autom. Reason.},
volume = {28},
number = {2},
pages = {205--232},
year = {2002},
url = {https://doi.org/10.1023/A:1015067300005},
doi = {10.1023/A:1015067300005},
timestamp = {Wed, 02 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jar/HustadtS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aiml/Kracht02,
author = {Marcus Kracht},
editor = {Philippe Balbiani and
Nobu{-}Yuki Suzuki and
Frank Wolter and
Michael Zakharyaschev},
title = {Notes on the Space Requirements for Checking Satisfiability in Modal
Logics},
booktitle = {Advances in Modal Logic 4, papers from the fourth conference on "Advances
in Modal logic," held in Toulouse, France, 30 September - 2 October
2002},
pages = {243--264},
publisher = {King's College Publications},
year = {2002},
url = {http://www.aiml.net/volumes/volume4/Kracht.ps},
timestamp = {Wed, 17 Jan 2024 09:58:31 +0100},
biburl = {https://dblp.org/rec/conf/aiml/Kracht02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/Bars02,
author = {Jean{-}Marie Le Bars},
title = {The 0-1 law fails for frame satisfiability of propositional modal
logic},
booktitle = {17th {IEEE} Symposium on Logic in Computer Science {(LICS} 2002),
22-25 July 2002, Copenhagen, Denmark, Proceedings},
pages = {225--234},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/LICS.2002.1029831},
doi = {10.1109/LICS.2002.1029831},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lics/Bars02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/amai/GiunchigliaT01,
author = {Enrico Giunchiglia and
Armando Tacchella},
title = {A Subset-Matching Size-Bounded Cache for Testing Satisfiability in
Modal Logics},
journal = {Ann. Math. Artif. Intell.},
volume = {33},
number = {1},
pages = {39--67},
year = {2001},
url = {https://doi.org/10.1023/A:1012380814999},
doi = {10.1023/A:1012380814999},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/amai/GiunchigliaT01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cade/BaaderT01,
author = {Franz Baader and
Stephan Tobies},
editor = {Rajeev Gor{\'{e}} and
Alexander Leitsch and
Tobias Nipkow},
title = {The Inverse Method Implements the Automata Approach for Modal Satisfiability},
booktitle = {Automated Reasoning, First International Joint Conference, {IJCAR}
2001, Siena, Italy, June 18-23, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2083},
pages = {92--106},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45744-5\_8},
doi = {10.1007/3-540-45744-5\_8},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/cade/BaaderT01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csl/Hemaspaandra00,
author = {Edith Hemaspaandra},
editor = {Peter Clote and
Helmut Schwichtenberg},
title = {Modal Satisfiability Is in Deterministic Linear Space},
booktitle = {Computer Science Logic, 14th Annual Conference of the EACSL, Fischbachau,
Germany, August 21-26, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1862},
pages = {332--342},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44622-2\_22},
doi = {10.1007/3-540-44622-2\_22},
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
biburl = {https://dblp.org/rec/conf/csl/Hemaspaandra00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tableaux/GiunchigliaT00,
author = {Enrico Giunchiglia and
Armando Tacchella},
editor = {Roy Dyckhoff},
title = {A Subset-Matching Size-Bounded Cache for Satisfiability in Modal Logics},
booktitle = {Automated Reasoning with Analytic Tableaux and Related Methods, International
Conference, {TABLEAUX} 2000, St Andrews, Scotland, UK, July 3-7, 2000,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1847},
pages = {237--251},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/10722086\_20},
doi = {10.1007/10722086\_20},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/tableaux/GiunchigliaT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aisc/HorrocksP98,
author = {Ian Horrocks and
Peter F. Patel{-}Schneider},
editor = {Jacques Calmet and
Jan A. Plaza},
title = {Optimising Propositional Modal Satisfiability for Description Logic
Subsumption},
booktitle = {Artificial Intelligence and Symbolic Computation, International Conference
AISC'98, Plattsburgh, New York, USA, September 16-18, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1476},
pages = {234--246},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0055916},
doi = {10.1007/BFB0055916},
timestamp = {Tue, 12 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aisc/HorrocksP98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChenL94,
author = {Cheng{-}Chia Chen and
I{-}Peng Lin},
title = {The Computational Complexity of the Satisfiability of Modal Horn Clauses
for Modal Propositional Logics},
journal = {Theor. Comput. Sci.},
volume = {129},
number = {1},
pages = {95--121},
year = {1994},
url = {https://doi.org/10.1016/0304-3975(94)90082-5},
doi = {10.1016/0304-3975(94)90082-5},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChenL94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jlp/CerroP87,
author = {Luis Fari{\~{n}}as del Cerro and
Martti Penttonen},
title = {A Note of the Complexity of the Satisfiability of Modal Horn Clauses},
journal = {J. Log. Program.},
volume = {4},
number = {1},
pages = {1--10},
year = {1987},
url = {https://doi.org/10.1016/0743-1066(87)90018-5},
doi = {10.1016/0743-1066(87)90018-5},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jlp/CerroP87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
retrieved on 2024-05-01 11:19 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
