default search action
Search dblp for Publications
export results for "toc:db/journals/tocl/tocl2.bht:"
@article{DBLP:journals/tocl/AielloM01, author = {Luigia Carlucci Aiello and Fabio Massacci}, title = {Verifying security protocols as planning in logic programming}, journal = {{ACM} Trans. Comput. Log.}, volume = {2}, number = {4}, pages = {542--580}, year = {2001}, url = {https://doi.org/10.1145/383779.383785}, doi = {10.1145/383779.383785}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tocl/AielloM01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tocl/AlurETP01, author = {Rajeev Alur and Kousha Etessami and Salvatore {La Torre} and Doron A. Peled}, title = {Parametric temporal logic for "model measuring"}, journal = {{ACM} Trans. Comput. Log.}, volume = {2}, number = {3}, pages = {388--407}, year = {2001}, url = {https://doi.org/10.1145/377978.377990}, doi = {10.1145/377978.377990}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tocl/AlurETP01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tocl/AntoniouBGM01, author = {Grigoris Antoniou and David Billington and Guido Governatori and Michael J. Maher}, title = {Representation results for defeasible logic}, journal = {{ACM} Trans. Comput. Log.}, volume = {2}, number = {2}, pages = {255--287}, year = {2001}, url = {https://doi.org/10.1145/371316.371517}, doi = {10.1145/371316.371517}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tocl/AntoniouBGM01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tocl/AptKS01, author = {Krzysztof R. Apt and Antonis C. Kakas and Fariba Sadri}, title = {Editorial}, journal = {{ACM} Trans. Comput. Log.}, volume = {2}, number = {4}, pages = {431}, year = {2001}, url = {https://doi.org/10.1145/383779.383823}, doi = {10.1145/383779.383823}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tocl/AptKS01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tocl/BlassG01, author = {Andreas Blass and Yuri Gurevich}, title = {Inadequacy of computable loop invariants}, journal = {{ACM} Trans. Comput. Log.}, volume = {2}, number = {1}, pages = {1--11}, year = {2001}, url = {https://doi.org/10.1145/371282.371285}, doi = {10.1145/371282.371285}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tocl/BlassG01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tocl/BryantGV01, author = {Randal E. Bryant and Steven M. German and Miroslav N. Velev}, title = {Processor verification using efficient reductions of the logic of uninterpreted functions to propositional logic}, journal = {{ACM} Trans. Comput. Log.}, volume = {2}, number = {1}, pages = {93--134}, year = {2001}, url = {https://doi.org/10.1145/371282.371364}, doi = {10.1145/371282.371364}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tocl/BryantGV01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tocl/DeneckerBM01, author = {Marc Denecker and Maurice Bruynooghe and V. Wiktor Marek}, title = {Logic programming revisited: Logic programs as inductive definitions}, journal = {{ACM} Trans. Comput. Log.}, volume = {2}, number = {4}, pages = {623--654}, year = {2001}, url = {https://doi.org/10.1145/383779.383789}, doi = {10.1145/383779.383789}, timestamp = {Tue, 04 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tocl/DeneckerBM01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tocl/EglyT01, author = {Uwe Egly and Hans Tompits}, title = {Proof-complexity results for nonmonotonic reasoning}, journal = {{ACM} Trans. Comput. Log.}, volume = {2}, number = {3}, pages = {340--387}, year = {2001}, url = {https://doi.org/10.1145/377978.377987}, doi = {10.1145/377978.377987}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tocl/EglyT01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tocl/EngelfrietH01, author = {Joost Engelfriet and Hendrik Jan Hoogeboom}, title = {{MSO} definable string transductions and two-way finite-state transducers}, journal = {{ACM} Trans. Comput. Log.}, volume = {2}, number = {2}, pages = {216--254}, year = {2001}, url = {https://doi.org/10.1145/371316.371512}, doi = {10.1145/371316.371512}, timestamp = {Mon, 16 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tocl/EngelfrietH01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tocl/FisherDP01, author = {Michael Fisher and Clare Dixon and Martin Peim}, title = {Clausal temporal resolution}, journal = {{ACM} Trans. Comput. Log.}, volume = {2}, number = {1}, pages = {12--56}, year = {2001}, url = {https://doi.org/10.1145/371282.371311}, doi = {10.1145/371282.371311}, timestamp = {Fri, 25 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tocl/FisherDP01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tocl/GiacomoLS01, author = {Giuseppe De Giacomo and Hector J. Levesque and Sebastian Sardi{\~{n}}a}, title = {Incremental execution of guarded theories}, journal = {{ACM} Trans. Comput. Log.}, volume = {2}, number = {4}, pages = {495--525}, year = {2001}, url = {https://doi.org/10.1145/383779.383782}, doi = {10.1145/383779.383782}, timestamp = {Tue, 04 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tocl/GiacomoLS01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tocl/KupfermanV01, author = {Orna Kupferman and Moshe Y. Vardi}, title = {Weak alternating automata are not that weak}, journal = {{ACM} Trans. Comput. Log.}, volume = {2}, number = {3}, pages = {408--429}, year = {2001}, url = {https://doi.org/10.1145/377978.377993}, doi = {10.1145/377978.377993}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tocl/KupfermanV01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tocl/LavracF01, author = {Nada Lavrac and Peter A. Flach}, title = {An extended transformation approach to inductive logic programming}, journal = {{ACM} Trans. Comput. Log.}, volume = {2}, number = {4}, pages = {458--494}, year = {2001}, url = {https://doi.org/10.1145/383779.383781}, doi = {10.1145/383779.383781}, timestamp = {Mon, 16 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tocl/LavracF01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tocl/Libkin01, author = {Leonid Libkin}, title = {Logics capturing local properties}, journal = {{ACM} Trans. Comput. Log.}, volume = {2}, number = {1}, pages = {135--153}, year = {2001}, url = {https://doi.org/10.1145/371282.371388}, doi = {10.1145/371282.371388}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tocl/Libkin01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tocl/LifschitzPV01, author = {Vladimir Lifschitz and David Pearce and Agust{\'{\i}}n Valverde}, title = {Strongly equivalent logic programs}, journal = {{ACM} Trans. Comput. Log.}, volume = {2}, number = {4}, pages = {526--541}, year = {2001}, url = {https://doi.org/10.1145/383779.383783}, doi = {10.1145/383779.383783}, timestamp = {Tue, 04 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tocl/LifschitzPV01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tocl/Lukasiewicz01, author = {Thomas Lukasiewicz}, title = {Probabilistic logic programming with conditional constraints}, journal = {{ACM} Trans. Comput. Log.}, volume = {2}, number = {3}, pages = {289--339}, year = {2001}, url = {https://doi.org/10.1145/377978.377983}, doi = {10.1145/377978.377983}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tocl/Lukasiewicz01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tocl/Reiter01, author = {Raymond Reiter}, title = {On knowledge-based programming with sensing in the situation calculus}, journal = {{ACM} Trans. Comput. Log.}, volume = {2}, number = {4}, pages = {433--457}, year = {2001}, url = {https://doi.org/10.1145/383779.383780}, doi = {10.1145/383779.383780}, timestamp = {Tue, 04 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tocl/Reiter01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tocl/RybinaV01, author = {Tatiana Rybina and Andrei Voronkov}, title = {A decision procedure for term algebras with queues}, journal = {{ACM} Trans. Comput. Log.}, volume = {2}, number = {2}, pages = {155--181}, year = {2001}, url = {https://doi.org/10.1145/371316.371494}, doi = {10.1145/371316.371494}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tocl/RybinaV01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tocl/Sergot01, author = {Marek J. Sergot}, title = {A computational theory of normative positions}, journal = {{ACM} Trans. Comput. Log.}, volume = {2}, number = {4}, pages = {581--622}, year = {2001}, url = {https://doi.org/10.1145/383779.383786}, doi = {10.1145/383779.383786}, timestamp = {Tue, 04 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tocl/Sergot01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tocl/VerbaetenSS01, author = {Sofie Verbaeten and Danny De Schreye and Konstantinos Sagonas}, title = {Termination proofs for logic programs with tabling}, journal = {{ACM} Trans. Comput. Log.}, volume = {2}, number = {1}, pages = {57--92}, year = {2001}, url = {https://doi.org/10.1145/371282.371357}, doi = {10.1145/371282.371357}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tocl/VerbaetenSS01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tocl/Voronkov01, author = {Andrei Voronkov}, title = {How to optimize proof-search in modal logics: new methods of proving redundancy criteria for sequent calculi}, journal = {{ACM} Trans. Comput. Log.}, volume = {2}, number = {2}, pages = {182--215}, year = {2001}, url = {https://doi.org/10.1145/371316.371511}, doi = {10.1145/371316.371511}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tocl/Voronkov01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.