HomeEPiC SeriesKalpa PublicationsPreprintsFor AuthorsFor Editors

Keyword:completeness

Papers
P versus NP
Frank Vega
EasyChair Preprint no. 3061
Models of Concurrent Kleene Algebra
Alexandra Silva
In:LPAR23. LPAR-23: 23rd International Conference on Logic for Programming, Artificial Intelligence and Reasoning
A Mathematical Conjecture from P versus NP
Frank Vega
EasyChair Preprint no. 3415
Representation and Reality by Language: How to make a home quantum computer?
Vasil Penchev
EasyChair Preprint no. 3371
From the Four-Colors Theorem to a Generalizing “Four-Letters Theorem”: a Sketch for “Human Proof” and the Philosophical Interpretation
Vasil Penchev
EasyChair Preprint no. 3194
Formalizing Bachmair and Ganzinger's Ordered Resolution Prover
Anders Schlichtkrull, Jasmin Christian Blanchette, Dmitriy Traytel and Uwe Waldmann
EasyChair Preprint no. 396
Reasoning Inside The Box: Deduction in Herbrand Logics
Liron Cohen and Yoni Zohar
In:GCAI 2017. 3rd Global Conference on Artificial Intelligence
Asynchronous testing of real-time systems
Puneet Bhateja
In:SCSS 2017. The 8th International Symposium on Symbolic Computation in Software Science 2017
A rewrite-based computational model for functional logic programming
Mircea Marin, Temur Kutsia and Besik Dundua
In:SCSS 2016. 7th International Symposium on Symbolic Computation in Software Science
Computational Completeness of Interaction Machines and Turing Machines
Peter Wegner, Eugene Eberbach and Mark Burgin
In:Turing-100. The Alan Turing Centenary
Copyright © 2012-2021 easychair.org. All rights reserved.