ACM Transactions on Computer Logic
2005
- A classification of symbolic transition systemsby: Thomas A. Henzinger, Rupak Majumdar, Jean-François Raskin v. 6 i. 1 p. 1 - 32
- Making abstract domains condensingby: Roberto Giacobazzi, Francesco Ranzato, Francesca Scozzari v. 6 i. 1 p. 33 - 60
- On equivalence and canonical forms in the LF type theoryby: Robert Harper, Frank Pfenning v. 6 i. 1 p. 61 - 101
- A new decidability technique for ground term rewriting systems with applicationsby: Rakesh M. Verma, Ara Hayrapetyan v. 6 i. 1 p. 102 - 123
- A modal logic framework for multi-agent belief fusionby: Churn-Jung Liau v. 6 i. 1 p. 124 - 174
- Eternity variables to prove simulation of specificationsby: Wim H. Hesselink v. 6 i. 1 p. 175 - 201
- Induction from answer sets in nonmonotonic logic programsby: Chiaki Sakama v. 6 i. 2 p. 203 - 231
- Complexity of propositional nested circumscription and nested abnormality theoriesby: Marco Cadoli, Thomas Eiter, Georg Gottlob v. 6 i. 2 p. 232 - 272
- From linear time to branching timeby: Orna Kupferman, Moshe Y. Vardi v. 6 i. 2 p. 273 - 294
- Comparisons and computation of well-founded semantics for disjunctive logic programsby: Kewen Wang, Lizhu Zhou v. 6 i. 2 p. 295 - 327
- Equivalences among aggregate queries with negationby: Sara Cohen, Yehoshua Sagiv, Werner Nutt v. 6 i. 2 p. 328 - 360
- Knuth-Bendix constraint solving is NP-completeby: Konstantin Korovin, Andrei Voronkov v. 6 i. 2 p. 361 - 388
- Reasoning about evolving nonmonotonic knowledge basesby: Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits v. 6 i. 2 p. 389 - 440
- Minimum model semantics for logic programs with negation-as-failureby: Panos Rondogiannis, William W. Wadge v. 6 i. 2 p. 441 - 467
- An elementary fragment of second-order lambda calculusby: Klaus Aehlig, Jan Johannsen v. 6 i. 2 p. 468 - 480
- Datalog programs and their persistency numbersby: Foto N. Afrati, Stavros S. Cosmadakis, Eugénie Foustoucos v. 6 i. 3 p. 481 - 518
- On the complexity of the disjunction property in intuitionistic and modal logicsby: Mauro Ferrari, Camillo Fiorentini, Guido Fiorino v. 6 i. 3 p. 519 - 538
- Disjunction and modular goal-directed proof searchby: Matthew Stone v. 6 i. 3 p. 539 - 577
- Sequent and hypersequent calculi for abelian and łukasiewicz logicsby: George Metcalfe, Nicola Olivetti, Dov M. Gabbay v. 6 i. 3 p. 578 - 613
- An effective decision procedure for linear arithmetic over the integers and realsby: Bernard Boigelot, Sébastien Jodogne, Pierre Wolper v. 6 i. 3 p. 614 - 633
- Arithmetic, first-order logic, and counting quantifiersby: Nicole Schweikardt v. 6 i. 3 p. 634 - 671
- Deterministic generators and games for Ltl fragmentsby: Rajeev Alur, Salvatore La Torre v. 5 i. 1 p. 1 - 25
- Precongruence formats for decorated trace semanticsby: Bard Bloom, Wan Fokkink, Rob J. van Glabbeek v. 5 i. 1 p. 26 - 78
- A modal logic for mobile agentsby: Rocco De Nicola, Michele Loreti v. 5 i. 1 p. 79 - 128
- Super logic programsby: Stefan Brass, Jürgen Dix, Teodor C. Przymusinski v. 5 i. 1 p. 129 - 176
- Automatic generation of rule-based constraint solvers over finite domainsby: Slim Abdennadher, Christophe Rigotti v. 5 i. 2 p. 177 - 205
- A logic programming approach to knowledge-state planning: Semantics and complexityby: Thomas Eiter, Wolfgang Faber, Nicola Leone, Gerald Pfeifer, Axel Polleres v. 5 i. 2 p. 206 - 263
- Convergent approximate solving of first-order constraints by approximate quantifiersby: Stefan Ratschan v. 5 i. 2 p. 264 - 281
- Inflationary fixed points in modal logicby: Anuj Dawar, Erich Grädel, Stephan Kreutzer v. 5 i. 2 p. 282 - 315
- Optimal length tree-like resolution refutations for 2SAT formulasby: K. Subramani v. 5 i. 2 p. 316 - 320
- Classes of term rewrite systems with polynomial confluence problemsby: Guillem Godoy, Robert Nieuwenhuis, Ashish Tiwari v. 5 i. 2 p. 321 - 331
- Some applications of logic to feasibility in higher typesby: Aleksandar Ignjatovic, Arun Sharma v. 5 i. 2 p. 332 - 350
- A decomposition-based implementation of search strategiesby: Laurent Michel, Pascal Van Hentenryck v. 5 i. 2 p. 351 - 383
- Basic theory of feature treesby: Pawel Mielniczuk v. 5 i. 3 p. 385 - 402
- Finite state machines for strings over infinite alphabetsby: Frank Neven, Thomas Schwentick, Victor Vianu v. 5 i. 3 p. 403 - 435
- Symbolic semantic rules for producing compact STGLAs from value passing process descriptionsby: Marco Bernardo v. 5 i. 3 p. 436 - 469
- Termination of simply moded logic programs with dynamic schedulingby: Annalisa Bossi, Sandro Etalle, Sabina Rossi, Jan-Georg Smaus v. 5 i. 3 p. 470 - 507
- Hypothesis-based semantics of logic programs in multivalued logicsby: Yann Loyer, Nicolas Spyratos, Daniel Stamate v. 5 i. 3 p. 508 - 527
- Reflective metalogical frameworksby: David A. Basin, Manuel Clavel, José Meseguer v. 5 i. 3 p. 528 - 576
- A theory of normed simulationsby: David Griffioen, Frits W. Vaandrager v. 5 i. 4 p. 577 - 610
- Abstract versus concrete computation on metric partial algebrasby: J. V. Tucker, Jeffery I. Zucker v. 5 i. 4 p. 611 - 668
- NEXP TIME-complete description logics with concrete domainsby: Carsten Lutz v. 5 i. 4 p. 669 - 705
- Proving correctness of timed concurrent constraint programsby: Frank S. de Boer, Maurizio Gabbrielli, Maria Chiara Meo v. 5 i. 4 p. 706 - 731
- Interval constraint solving for camera control and motion planningby: Frédéric Benhamou, Frédéric Goualard, Eric Languénou, Marc Christie v. 5 i. 4 p. 732 - 767
- The marriage of effects and monadsby: Philip Wadler, Peter Thiemann v. 4 i. 1 p. 1 - 32
- Deciding the confluence of ordered term rewrite systemsby: Hubert Comon, Paliath Narendran, Robert Nieuwenhuis, Michaël Rusinowitch v. 4 i. 1 p. 33 - 55
- Resource-distribution via Boolean constraintsby: James Harland, David J. Pym v. 4 i. 1 p. 56 - 90
- Fixed-parameter complexity of semantics for logic programsby: Zbigniew Lonc, Miroslaw Truszczynski v. 4 i. 1 p. 91 - 119
- A complete characterization of complete intersection-type preordersby: Mariangiola Dezani-Ciancaglini, Furio Honsell, Fabio Alessi v. 4 i. 1 p. 120 - 147
- On proving left termination of constraint logic programsby: Frédéric Mesnard, Salvatore Ruggieri v. 4 i. 2 p. 1 - 26
- Computational properties of metaquerying problemsby: Fabrizio Angiulli, Rachel Ben-Eliyahu-Zohary, Giovambattista Ianni, Luigi Palopoli v. 4 i. 2 p. 149 - 180
- Simulation-based minimazationby: Doron Bustan, Orna Grumberg v. 4 i. 2 p. 181 - 206
- On proving left termination of constraint logic programsby: Frédéric Mesnard, Salvatore Ruggieri v. 4 i. 2 p. 207 - 259
- Logics of metric spacesby: Oliver Kutz, Frank Wolter, Holger Sturm, Nobu-Yuki Suzuki, Michael Zakharyaschev v. 4 i. 2 p. 260 - 294
- LICS 2001 special issueby: Erich Grädel, Joseph Y. Halpern, Radha Jagadeesan, Adolfo Piperno v. 4 i. 3 p. 295 - 295
- An n! lower bound on formula sizeby: Micah Adler, Neil Immerman v. 4 i. 3 p. 296 - 314
- Typechecking XML views of relational databasesby: Noga Alon, Tova Milo, Frank Neven, Dan Suciu, Victor Vianu v. 4 i. 3 p. 315 - 354
- Substructural logic and partial correctnessby: Dexter Kozen, Jerzy Tiuryn v. 4 i. 3 p. 355 - 378
- Topological incompleteness and order incompleteness of the lambda calculuby: Antonino Salibra v. 4 i. 3 p. 379 - 401
- Eliminating definitions and Skolem functions in first-order logicby: Jeremy Avigad v. 4 i. 3 p. 402 - 415
- A dynamic approach to characterizing termination of general logic programsby: Yi-Dong Shen, Jia-Huai You, Li-Yan Yuan, Samuel S. P. Shen, Qiang Yang v. 4 i. 4 p. 417 - 430
- Variable independence for first-order definable constraintsby: Leonid Libkin v. 4 i. 4 p. 431 - 451
- Model checking stochastic automataby: Jeremy Bryans, Howard Bowman, John Derrick v. 4 i. 4 p. 452 - 492
- Higher-order pattern complement and the strict lambda-calculusby: Alberto Momigliano, Frank Pfenning v. 4 i. 4 p. 493 - 529
- Interaction between path and type constraintsby: Peter Buneman, Wenfei Fan, Scott Weinstein v. 4 i. 4 p. 530 - 577
- Abstract state machines capture parallel algorithmsby: Andreas Blass, Yuri Gurevich v. 4 i. 4 p. 578 - 651
- The intuitionism behind Statecharts stepsby: Gerald Lüttgen, Michael Mendler v. 3 i. 1 p. 1 - 41
- Datalog LITE: a deductive query language with linear time model checkingby: Georg Gottlob, Erich Grädel, Helmut Veith v. 3 i. 1 p. 42 - 79
- Reasoning with higher-order abstract syntax in a logical frameworkby: Raymond McDowell, Dale Miller v. 3 i. 1 p. 80 - 136
- Intuitionistic Light Affine Logicby: Andrea Asperti, Luca Roversi v. 3 i. 1 p. 137 - 175
- Description logics of minimal knowledge and negation as failureby: Francesco M. Donini, Daniele Nardi, Riccardo Rosati v. 3 i. 2 p. 177 - 225
- Sequent calculi for propositional nonmonotonic logicsby: Piero A. Bonatti, Nicola Olivetti v. 3 i. 2 p. 226 - 278
- Abstract computability and algebraic specificationby: J. V. Tucker, Jeffery I. Zucker v. 3 i. 2 p. 279 - 333
- Editorialby: Martín Abadi, Leonid Libkin, Frank Pfenning v. 3 i. 3 p. 335 - 335
- On first-order topological queriesby: Martin Grohe, Luc Segoufin v. 3 i. 3 p. 336 - 358
- Probabilistic game semanticsby: Vincent Danos, Russell Harmer v. 3 i. 3 p. 359 - 382
- A syntactical analysis of non-size-increasing polynomial time computationby: Klaus Aehlig, Helmut Schwichtenberg v. 3 i. 3 p. 383 - 401
- Resource-bounded continuity and sequentiality for type-two functionalsby: Samuel R. Buss, Bruce M. Kapron v. 3 i. 3 p. 402 - 417
- Back and forth between guarded and modal logicsby: Erich Grädel, Colin Hirsch, Martin Otto v. 3 i. 3 p. 418 - 463
- Deciding and axiomatizing weak ST bisimulation for a process algebra with recursion and action refinementby: Mario Bravetti, Roberto Gorrieri v. 3 i. 4 p. 465 - 520
- Polynomial-time computation via local inference relationsby: Robert Givan, David A. McAllester v. 3 i. 4 p. 521 - 541
- Revisiting quantification in autoepistemic logicby: Michael Kaminski, Guy Rey v. 3 i. 4 p. 542 - 561
- Typed interpretations of extensible objectsby: Viviana Bono, Michele Bugliesi, Silvia Crafa v. 3 i. 4 p. 562 - 603
- Boolean satisfiability with transitivity constraintsby: Randal E. Bryant, Miroslav N. Velev v. 3 i. 4 p. 604 - 627
- Inadequacy of computable loop invariantsby: Andreas Blass, Yuri Gurevich v. 2 i. 1 p. 1 - 11
- Clausal temporal resolutionby: Michael Fisher, Clare Dixon, Martin Peim v. 2 i. 1 p. 12 - 56
- Termination proofs for logic programs with tablingby: Sofie Verbaeten, Danny De Schreye, Konstantinos F. Sagonas v. 2 i. 1 p. 57 - 92
- Processor verification using efficient reductions of the logic of uninterpreted functions to propositional logicby: Randal E. Bryant, Steven M. German, Miroslav N. Velev v. 2 i. 1 p. 93 - 134
- Logics capturing local propertiesby: Leonid Libkin v. 2 i. 1 p. 135 - 153
- A decision procedure for term algebras with queuesby: Tatiana Rybina, Andrei Voronkov v. 2 i. 2 p. 155 - 181
- How to optimize proof-search in modal logics: new methods of proving redundancy criteria for sequent calculiby: Andrei Voronkov v. 2 i. 2 p. 182 - 215
- MSO definable string transductions and two-way finite-state transducersby: Joost Engelfriet, Hendrik Jan Hoogeboom v. 2 i. 2 p. 216 - 254
- Representation results for defeasible logicby: Grigoris Antoniou, David Billington, Guido Governatori, Michael J. Maher v. 2 i. 2 p. 255 - 287
- Probabilistic logic programming with conditional constraintsby: Thomas Lukasiewicz v. 2 i. 3 p. 289 - 339
- Proof-complexity results for nonmonotonic reasoningby: Uwe Egly, Hans Tompits v. 2 i. 3 p. 340 - 387
- Parametric temporal logic for "model measuring"by: Rajeev Alur, Kousha Etessami, Salvatore La Torre, Doron Peled v. 2 i. 3 p. 388 - 407
- Weak alternating automata are not that weakby: Orna Kupferman, Moshe Y. Vardi v. 2 i. 3 p. 408 - 429
- Editorialby: Krzysztof R. Apt, Antonis C. Kakas, Fariba Sadri v. 2 i. 4 p. 431 - 431
- On knowledge-based programming with sensing in the situation calculusby: Raymond Reiter v. 2 i. 4 p. 433 - 457
- An extended transformation approach to inductive logic programmingby: Nada Lavrac, Peter A. Flach v. 2 i. 4 p. 458 - 494
- Incremental execution of guarded theoriesby: Giuseppe De Giacomo, Hector J. Levesque, Sebastian Sardiña v. 2 i. 4 p. 495 - 525
- Strongly equivalent logic programsby: Vladimir Lifschitz, David Pearce, Agustín Valverde v. 2 i. 4 p. 526 - 541
- Verifying security protocols as planning in logic programmingby: Luigia Carlucci Aiello, Fabio Massacci v. 2 i. 4 p. 542 - 580
- A computational theory of normative positionsby: Marek J. Sergot v. 2 i. 4 p. 581 - 622
- Logic programming revisited: Logic programs as inductive definitionsby: Marc Denecker, Maurice Bruynooghe, V. Wiktor Marek v. 2 i. 4 p. 623 - 654
- Mechanizing UNITY in Isabelleby: Lawrence C. Paulson v. 1 i. 1 p. 3 - 32
- Logics with counting and local propertiesby: Leonid Libkin v. 1 i. 1 p. 33 - 59
- On Hoare logic and Kleene algebra with testsby: Dexter Kozen v. 1 i. 1 p. 60 - 76
- Sequential abstract-state machines capture sequential algorithmsby: Yuri Gurevich v. 1 i. 1 p. 77 - 111
- Locality of order-invariant first-order formulasby: Martin Grohe, Thomas Schwentick v. 1 i. 1 p. 112 - 130
- Compilability and compact representations of revision of Horn knowledge basesby: Paolo Liberatore v. 1 i. 1 p. 131 - 161
- Model-checking continous-time Markov chainsby: Adnan Aziz, Kumud Sanwal, Vigyan Singhal, Robert K. Brayton v. 1 i. 1 p. 162 - 170
- A note on the complexity of propositional Hoare logicby: Ernie Cohen, Dexter Kozen v. 1 i. 1 p. 171 - 174
- First-order conditional logic for default reasoning revisitedby: Nir Friedman, Joseph Y. Halpern, Daphne Koller v. 1 i. 2 p. 175 - 207
- Probabilistic agent programsby: Jürgen Dix, Mirco Nanni, V. S. Subrahmanian v. 1 i. 2 p. 208 - 246
- Knowledge in multiagent systems: initial configurations and broadcastby: Alessio Lomuscio, Ron van der Meyden, Mark Ryan v. 1 i. 2 p. 247 - 284
- Search and strategies in OPLby: Pascal Van Hentenryck, Laurent Perron, Jean-Francois Puget v. 1 i. 2 p. 285 - 320
![[SWISH++]](/docis/swish-powered.gif){kind=small}
