Journal of Logic and Computation, Volume 19

Volume 19, Number 1, February 2009

• S. Barry Cooper, Benedikt Löwe, Andrea Sorbi:
  Logic and Computation in the Real World: CiE 2007. 1-2
  
• George Barmpalias, Douglas A. Cenzer, Jeffrey B. Remmel, Rebecca Weber:
  K-Triviality of Closed Sets and Continuous Functions. 3-16
  
• Andrej Bauer, Christopher A. Stone:
  RZ: a Tool for Bringing Constructive and Computable Mathematics Closer to Programming Practice. 17-43
  
• Vasco Brattka, Guido Gherardi:
  Borel Complexity of Topological Operations on Computable Metric Spaces. 45-76
  
• Douglas A. Cenzer, Geoffrey LaForte, Guohua Wu:
  Pseudojumps and Pi₁⁰ Classes. 77-87
  
• Yijia Chen, Jörg Flum:
  Subexponential Time and Fixed-parameter Tractability: Exploiting the Miniaturization Mapping. 89-122
  
• Andrés Cordón-Franco, Alejandro Fernández-Margarit, Francisco Félix Lara Martín:
  Existentially Closed Models and Conservation Results in Bounded Arithmetic. 123-143
  
• Barbara F. Csima:
  The Settling Time Reducibility Ordering and Delta₂⁰ Sets. 145-150
  
• Iskander Sh. Kalimullin:
  Enumeration Degrees and Enumerability of Familes. 151-158
  
• Margarita V. Korovina, Oleg V. Kudinov:
  The Uniformity Principle for Sigma-definability. 159-174
  
• Branislav Rovan, L'ubos Steskal:
  Infinite Computations and a Hierarchy in Delta₃ Reconsidered. 175-176
  
• Victor L. Selivanov:
  Undecidability in Some Structures Related to Computation Theory. 177-197
  
• Alexandra A. Soskova, Ivan N. Soskov:
  A Jump Inversion Theorem for the Degree Spectra. 199-215
  
• Iain A. Stewart:
  Logical and Complexity-theoretic Aspects of Models of Computation with Restricted Access to Arrays. 217-242
  

Volume 19, Number 2, April 2009

• Matthias Baaz, George Metcalfe:
  Fuzzy Logic Corner. 343
  

• Petr Cintula, Petr Hájek:
  Complexity Issues in Axiomatic Extensions of Lukasiewicz Logic. 245-260
  

• Maribel Fernández:
  Rewriting Corner. 261
  

• Miquel Bofill, Albert Rubio:
  Paramodulation with Well-founded Orderings. 263-302
  

• Yde Venema:
  Algebraic and Coalgebraic Logic Corner. 303
  

• Szabolcs Mikulás:
  Algebras of Relations and Relevance Logic. 305-321
  

• Emil Jerábek:
  Proof Complexity of the Cut-free Calculus of Structures. 323-339
  
• Murdoch James Gabbay:
  Nominal Algebra and the HSP Theorem. 341-367
  
• Nicole Bidoit, Matthieu Objois:
  Fixpoint and While Temporal Query Languages. 369-404
  
• Yan Zhang:
  Updating Epistemic Logic Programs. 405-423
  
• Santiago Figueira, Joseph S. Miller, André Nies:
  Indifferent Sets. 425-443
  

Volume 19, Number 3, June 2009

• Dov M. Gabbay, Odinaldo Rodrigues, Gabriella Pigozzi:
  Connections between Belief Revision, Belief Merging and Social Choice. 445-446
  
• Konstantinos Georgatos:
  Geodesic Revision. 447-459
  
• Jon Williamson:
  Aggregating Judgements by Merging Evidence. 461-473
  
• Maria Silvia Pini, Francesca Rossi, Kristen Brent Venable, Toby Walsh:
  Aggregating Partially Ordered Preferences. 475-502
  
• Juan Perote-Peña, Ashley Piggins:
  Non-manipulable Social Welfare Functions when Preferences are Fuzzy. 503-515
  
• Tijmen R. Daniëls, Eric Pacuit:
  A General Approach to Aggregation Problems. 517-536
  

Volume 19, Number 4, August 2009

• Stefania Costantini, Richard Watson:
  Editorial. 537-538
  

• Martin Gebser, Mona Gharib, Robert E. Mercer, Torsten Schaub:
  Monotonic Answer Set Programming. 539-564
  
• Igor Stéphan, Benoit Da Mota, Pascal Nicolas:
  From (Quantified) Boolean Formulae to Answer Set Programming. 565-590
  
• Emilia Oikarinen, Tomi Janhunen:
  A Translation-based Approach to the Verification of Modular Equivalence. 591-613
  
• Martin Brain, Marina De Vos:
  The Significance of Memory Costs in Answer Set Solver Implementation. 615-641
  
• Francesco Ricca, Lorenzo Gallucci, Roman Schindlauer, Tina Dell'Armi, Giovanni Grasso, Nicola Leone:
  OntoDLV: An ASP-based System for Enterprise Ontologies. 643-670
  
• Giovambattista Ianni, Alessandra Martello, Claudio Panetta, Giorgio Terracina:
  Efficiently Querying RDF(S) Ontologies with Answer Set Programming. 671-695
  
• Giuliano Grossi, Massimo Marchi, Enrico Pontelli, Alessandro Provetti:
  Experimental Analysis of Graph-based Answer Set Computation over Parallel and Distributed Architectures. 697-715
  

Volume 19, Number 5, October 2009

• Giorgos Flouris, Mathieu d'Aquin, Grigoris Antoniou, Jeff Z. Pan, Dimitris Plexousakis:
  Special Issue on Ontology Dynamics. 717-719
  

• Márcio Moretto Ribeiro, Renata Wassermann:
  Base Revision for Ontology Debugging. 721-743
  
• Giuseppe De Giacomo, Maurizio Lenzerini, Antonella Poggi, Riccardo Rosati:
  On Instance-level Update and Erasure in Description Logic Ontologies. 745-770
  
• Jennifer Golbeck, Christian Halaschek-Wiener:
  Trust-based Revision for Expressive Web Syndication. 771-790
  
• Joe Geldart, William Song:
  Category-based Equational Reasoning: An Approach to Ontology Integration. 791-806
  
• Christian Meilicke, Heiner Stuckenschmidt, Andrei Tamilin:
  Reasoning Support for Mapping Revision. 807-829
  
• Kévin Ottens, Nathalie Hernandez, Marie Pierre Gleizes, Nathalie Aussenac-Gilles:
  A Multi-Agent System for Dynamic Ontologies. 831-858
  
• Silvana Castano, Irma Sofia Espinosa Peraldi, Alfio Ferrara, Vangelis Karkaletsis, Atila Kaya, Ralf Möller, Stefano Montanelli, Georgios Petasis, Michael Wessel:
  Multimedia Interpretation for Dynamic Ontology Evolution. 859-897
  

Volume 19, Number 6, December 2009

• Trevor J. M. Bench-Capon, Henry Prakken:
  Editorial: Logic and Law Corner. 899
  
• Emiliano Lorini, Dominique Longin, Benoit Gaudou, Andreas Herzig:
  The Logic of Acceptance: Grounding Institutions on Agents' Attitudes. 901-940
  
• Adam Zachary Wyner, Trevor J. M. Bench-Capon:
  Modelling Judicial Context in Argumentation Frameworks. 941-968
  

• Arnon Avron:
  Editorial: Proof Theory Corner. 969
  
• Luca Alberucci:
  Sequent Calculi for the Modal µ-Calculus over S5. 971-985
  

• Walter Alexandre Carnielli, Heinrich Wansing:
  Editorial and call for papers: The Non-classical Logics Corner of the Journal of Logic and Computation. 987
  
• Vladimir V. Rybakov:
  Linear Temporal Logic LTK_K extended by Multi-Agent Logic K_n with Interacting Agents. 989-1017
  
• Manuela Busaniche, Roberto Cignoli:
  Residuated Lattices as an Algebraic Semantics for Paraconsistent Nelson's Logic. 1019-1029
  

• Félix Bou, Francesc Esteva, Josep Maria Font, Àngel J. Gil, Lluis Godo, Antoni Torrens, Ventura Verdú:
  Logics Preserving Degrees of Truth from Varieties of Residuated Lattices. 1031-1069
  

• Phan Minh Thang, Phan Minh Dung, Nguyen Duy Hung:
  Towards a Common Framework for Dialectical Proof Procedures in Abstract Argumentation. 1071-1109
  

• Jean-Yves Béziau:
  Editorial: Introduction to the Universal Logic Corner. 1111
  
• Zofia Kostrzycka:
  On the Density of Truth of Locally Finite Logics. 1113-1125
  

• Ji Ruan, Wiebe van der Hoek, Michael Wooldridge:
  Verification of Games in the Game Description Language. 1127-1156
  

• Merlijn Sevenster:
  Model-theoretic and Computational Properties of Modal Dependence Logic. 1157-1173
  
• Cesarino Bertini, Robert Leporini:
  An Axiomatic System Suggested by Quantum Computation. 1175-1198
  
• Zofia Kostrzycka:
  On a Finitely Axiomatizable Kripke Incomplete Logic Containing KTB. 1199-1205
  
• Matthew Collinson, Brian Monahan, David J. Pym:
  A Logical and Computational Theory of Located Resource. 1207-1244
  
• David A. Basin, Carlos Caleiro, Jaime Ramos, Luca Viganò:
  Labelled Tableaux for Distributed Temporal Logic. 1245-1279
  
• Amílcar Sernadas, Cristina Sernadas, João Rasga, Marcelo E. Coniglio:
  A Graph-theoretic Account of Logics. 1281-1320
  
• Amílcar Sernadas, Cristina Sernadas, João Rasga, Marcelo E. Coniglio:
  On Graph-theoretic Fibring of Logics. 1321-1357
  
• Manuel Bodirsky, Hubie Chen:
  Qualitative Temporal and Spatial Reasoning Revisited. 1359-1383
  
• Rafael H. Bordini, Michael Fisher, Michael Wooldridge, Willem Visser:
  Property-based Slicing for Agent Verification. 1385-1425
  
• Chunlai Zhou:
  A Complete Deductive System for Probability Logic. 1427-1454
  
• Murdoch James Gabbay, Aad Mathijssen:
  Nominal (Universal) Algebra: Equational Logic with Names and Binding. 1455-1508
  
• Hanifa Boucheneb, Guillaume Gardey, Olivier H. Roux:
  TCTL Model Checking of Time Petri Nets. 1509-1540
  
• Stéphane Demri, Régis Gascon:
  The Effects of Bounding Syntactic Resources on Presburger LTL. 1541-1575
  
• Salem Benferhat, Sylvain Lagrue, Julien Rossit:
  Max-based Prioritized Information Fusion without Commensurability. 1577-1610
  

Last update Fri May 24 17:39:12 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page