default search action
ACM Transactions on Computational Logic, Volume 14
Volume 14, Number 1, February 2013
- Hariolf Betz, Thom W. Frühwirth:
Linear-Logic Based Analysis of Constraint Handling Rules with Disjunction. 1:1-1:37 - Markus Krötzsch
, Sebastian Rudolph
Complexities of Horn Description Logics. 2:1-2:36 - Xiaoping Chen, Jianmin Ji
Computing Loops with at Most One External Support Rule. 3:1-3:34 - Mathieu Baudet
YAPA: A Generic Tool for Computing Intruder Knowledge. 4:1-4:32 - Richard McKinley
Proof Nets for Herbrand's Theorem. 5:1-5:31 - Dominique Larchey-Wendling
Nondeterministic Phase Semantics and the Undecidability of Boolean BI. 6:1-6:41 - Marcello M. Bonsangue
Sound and Complete Axiomatizations of Coalgebraic Language Equivalence. 7:1-7:52
Volume 14, Number 2, June 2013
- Alexander Kartzow:
First-Order Logic on Higher-Order Nested Pushdown Trees. 8:1-8:45 - Paul Gastin, Nathalie Sznajder:
Fair Synthesis for Asynchronous Distributed Systems. 9:1-9:31 - Paulo Shakarian, Matthias Broecheler, V. S. Subrahmanian, Cristian Molinaro
Using Generalized Annotated Programs to Solve Social Network Diffusion Optimization Problems. 10:1-10:40 - Mnacho Echenim, Nicolas Peltier:
Instantiation Schemes for Nested Theories. 11:1-11:34 - Gerardo I. Simari
Parallel Abductive Query Answering in Probabilistic Logic Programs. 12:1-12:39 - Roman Kontchakov
Topological Logics with Connectedness over Euclidean Spaces. 13:1-13:48 - James P. Delgrande, Torsten Schaub
A Model-Theoretic Approach to Belief Change in Answer Set Programming. 14:1-14:46 - Martin Gebser, Torsten Schaub
Tableau Calculi for Logic Programs under Answer Set Semantics. 15:1-15:40 - José Júlio Alferes
Query-Driven Procedures for Hybrid MKNF Knowledge Bases. 16:1-16:43
Volume 14, Number 3, August 2013
- Johan Wittocx, Marc Denecker
Constraint Propagation for First-Order Logic and Inductive Definitions. 17:1-17:45 - M. Praveen:
Does Treewidth Help in Modal Satisfiability? 18:1-18:32 - Tony Tan:
Graph Reachability and Pebble Automata over Infinite Alphabets. 19:1-19:31 - Olaf Beyersdorff
Parameterized Complexity of DPLL Search Procedures. 20:1-20:21 - Angelos Charalambidis
Extensional Higher-Order Logic Programming. 21:1-21:40 - Elvira Albert, Samir Genaim
On the Inference of Resource Usage Upper and Lower Bounds. 22:1-22:35 - Floor Sietsma, Krzysztof R. Apt:
Common Knowledge in Email Exchanges. 23:1-23:23 - Andreas Herzig, Jérôme Lang, Pierre Marquis
Propositional Update Operators Based on Formula/Literal Dependence. 24:1-24:31
Volume 14, Number 4, November 2013
- Wojciech Kazana, Luc Segoufin:
Enumeration of monadic second-order queries on trees. 25:1-25:12 - Jónathan Heras
Computing persistent homology within Coq/SSReflect. 26:1-26:16 - Ori Lahav
A unified semantic framework for fully structural propositional sequent systems. 27:1-27:33 - Jose Gaintzarain
Logical foundations for more expressive declarative temporal logic programming languages. 28:1-28:41 - Olivier Danvy
Three syntactic theories for combinatory graph reduction. 29:1-29:27 - Manuel Bodirsky
Constraint satisfaction tractability from semi-lattice operations on infinite sets. 30:1-30:19 - Jeroen Ketema, Jakob Grue Simonsen:
Least upper bounds on the size of confluence and church-rosser diagrams in term rewriting and λ-calculus. 31:1-31:28 - Florian Rabe
Logical relations for a logical framework. 32:1-32:34 - Taolue Chen
Verification of linear duration properties over continuous-time markov chains. 33:1-33:35 - Roy Dyckhoff, Mehrnoosh Sadrzadeh
Algebra, proof theory and applications for an intuitionistic logic of propositions, actions and adjoint modal operators. 34:1-34:37
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.
last updated on 2024-11-18 20:34 CET 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: