![](https://dblp.uni-trier.de./img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de./img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de./img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
Journal of Logic(al) and Algebraic (Methods in) Programming, Volume 83
Volume 83, Number 1, January 2014
- Benoît Delahaye
, Kim G. Larsen
, Axel Legay:
Stuttering for Abstract Probabilistic Automata. 1-19 - Gabriel Aranda-López, Susana Nieva
, Fernando Sáenz-Pérez
, Jaime Sánchez-Hernández
:
An extended constraint deductive database: Theory and implementation. 20-52 - Naoki Nishida, Germán Vidal
:
Conversion to tail recursion in term rewriting. 53-63 - Luca Aceto, Anna Ingólfsdóttir, Eugen-Ioan Goriac:
SOS rule formats for idempotent terms and idempotent unary operators. 64-80
Volume 83, Number 2, March 2014
- Rebecca Capone:
Publisher's Note. 81 - Jan A. Bergstra, John V. Tucker:
Editor's Note. 82 - Rocco De Nicola
:
Editor's Note. 83
- Rudolf Berghammer, Bernhard Möller, Michael Winter:
Preface. 85-86 - Alasdair Armstrong, Georg Struth, Tjark Weber:
Programming and automating mathematics in the Tarski-Kleene hierarchy. 87-102 - Rudolf Berghammer:
Computing minimal extending sets by relation-algebraic modeling and development. 103-119 - Rudolf Berghammer, Agnieszka Rusinowska
, Harrie C. M. de Swart
:
Spatial voting games, relation algebra and RelView. 120-134 - Han-Hing Dang, Roland Glück
, Bernhard Möller, Patrick Roocks, Andreas Zelend:
Exploring modal worlds. 135-153 - Jules Desharnais, Anastasiya Grinenko, Bernhard Möller:
Relational style laws and constructs of linear algebra. 154-168 - Ivo Düntsch
, Ewa Orlowska:
Discrete dualities for some algebras with relations. 169-179 - Samir Elloumi, Bilel Boulifa, Ali Jaoua
, Mohammad Saleh
, Jameela Al Otaibi, Marcelo F. Frias:
Inference engine based on closure and join operators over Truth Table Binary Relations. 180-193 - Walter Guttmann
:
Multirelations with infinite computations. 194-211 - Peter Höfner, Annabelle McIver
:
Hopscotch - reaching the target hop by hop. 212-224 - Wolfram Kahl:
Towards "mouldable code" via nested code graph transformation. 225-234 - Roger D. Maddux
:
Arrow's Theorem for incomplete relations. 235-248 - José Nuno Oliveira
:
A relation-algebraic approach to the "Hoare logic" of functional dependencies. 249-262 - Norihiro Tsumagari, Hitoshi Furusawa, Yasuo Kawahara:
Relations into algebras of probabilistic distributions. 263-283 - Michael Winter
, Peter Kempf:
Relational properties of sequential composition of coalgebras. 284-299 - Rudolf Berghammer, Michael Winter
:
Gunther Schmidt's life as a mathematician and computer scientist. 300-308 - Martin E. Müller, Bernhard Möller:
On nothing. 309-317
Volume 83, Numbers 3-4, May - July 2014
- Razvan Diaconescu, Ionut Tutu:
Foundations for structuring behavioural specifications. 319-338 - Ernst-Erich Doberkat:
Algebraic properties of stochastic effectivity functions. 339-358
Volume 83, Numbers 5-6, September - November 2014
- Uwe Wolter:
Guest Editor's foreword. 359 - Crystal Chang Din
, Olaf Owe
:
A sound and complete reasoning system for asynchronous communication with shared futures. 360-383 - Fabrizio Biondi, Axel Legay, Bo Friis Nielsen
, Andrzej Wasowski
:
Maximizing entropy over Markov processes. 384-399 - Ka I Pun, Martin Steffen, Volker Stolz
:
Deadlock checking by data race detection. 400-426 - Juan de Lara, Esther Guerra
:
Towards the flexible reuse of model transformations: A formal approach based on graph transformation. 427-458 - Denis Firsov
, Tarmo Uustalu
:
Certified CYK parsing of context-free languages. 459-468
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
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.