default search action
15th WoLLIC 2008: Edinburgh, UK
- Wilfrid Hodges, Ruy J. G. B. de Queiroz:
Logic, Language, Information and Computation, 15th International Workshop, WoLLIC 2008, Edinburgh, UK, July 1-4, 2008, Proceedings. Lecture Notes in Computer Science 5110, Springer 2008, ISBN 978-3-540-69936-1
Tutorials and Invited Lectures
- Olivier Danvy
, Jacob Johannsen:
Inter-deriving Semantic Artifacts for Object-Oriented Programming. 1-16 - Anuj Dawar
On the Descriptive Complexity of Linear Algebra. 17-25 - Samuel J. Lomonaco:
Talks on Quantum Computing. 26-27 - Ilya Mezhirov, Nikolai K. Vereshchagin
On Game Semantics of the Affine and Intuitionistic Logics. 28-42 - Mark Steedman:
The Grammar of Scope. 43
Contributed Papers
- Tamar Aizikowitz, Michael Kaminski:
Conjunctive Grammars and Alternating Pushdown Automata. 44-55 - Carlos Areces
Expressive Power and Decidability for Memory Logics. 56-68 - Ofer Arieli, Anna Zamansky:
Reasoning with Uncertainty by Nmatrix-Metric Semantics. 69-82 - Mario R. F. Benevides
A Propositional Dynamic Logic for CCS Programs. 83-97 - Alan Bundy, Michael Chan:
Towards Ontology Evolution in Physics. 98-110 - Christophe Calvès, Maribel Fernández:
Nominal Matching and Alpha-Equivalence. 111-122 - Graçaliz Pereira Dimuro, Benjamín R. C. Bedregal, Renata Hax Sander Reiser
Interval Additive Generators of Interval T-Norms. 123-135 - Jan van Eijck, Yanjing Wang
Propositional Dynamic Logic as a Logic of Belief Revision. 136-148 - Amin Farjudian
Time Complexity and Convergence Analysis of Domain Theoretic Picard Method. 149-163 - Santiago Figueira, Daniel Gorín, Rafael Grimson:
On the Formal Semantics of IF-Like Logics. 164-178 - Murdoch Gabbay
One-and-a-Halfth Order Terms: Curry-Howard and Incomplete Derivations. 179-193 - Didier Galmiche, Yakoub Salhi
Labelled Calculi for Lukasiewicz Logics. 194-207 - Edward A. Hirsch, Dmitry Itsykson:
An Infinitely-Often One-Way Function Based on an Average-Case Assumption. 208-217 - Shingo Ibuka, Makoto Kikuchi, Hirotaka Kikyo
On Characteristic Constants of Theories Defined by Kolmogorov Complexity. 218-225 - Pascal Koiran, Jürgen Landes, Natacha Portier, Penghui Yao:
Adversary Lower Bounds for Nonadaptive Quantum Algorithms. 226-237 - Juha Kontinen, Heribert Vollmer
On Second-Order Monadic Groupoidal Quantifiers. 238-248 - Jeff B. Paris, Soroush R. Rad:
Inference Processes for Quantified Predicate Knowledge. 249-259 - Silvio do Lago Pereira, Leliane Nunes de Barros:
Using alpha-ctl to Specify Complex Planning Goals. 260-271 - Carl Pollard:
Hyperintensional Questions. 272-285 - Livio Robaldo
Skolem Theory and Generalized Quantifiers. 286-297 - Renata P. de Freitas, Paulo A. S. Veloso, Sheila R. M. Veloso, Jorge Petrucio Viana:
On a Graph Calculus for Algebras of Relations. 298-312
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-10-31 20:02 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: