Result 1 to 20 of 662 total
Herbrand-confluence for cut elimination in classical first order logic. (English)
Cégielski, Patrick (ed.) et al., Computer science logic (CSL’12). 26th international workshop, 21th annual conference of the EACSL, September 3‒6, 2012, Fontainebleau, France. Selected papers based on the presentations at the conference. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-42-2). LIPICS ‒ Leibniz International Proceedings in Informatics 16, 320-334, electronic only (2012).
1
Certification of nontermination proofs. (English)
Beringer, Lennart (ed.) et al., Interactive theorem proving. Third international conference, ITP 2012, Princeton, NJ, USA, August 13‒15, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32346-1/pbk). Lecture Notes in Computer Science 7406, 266-282 (2012).
2
KBCV ‒ Knuth-bendix completion visualizer. (English)
Gramlich, Bernhard (ed.) et al., Automated reasoning. 6th international joint conference, IJCAR 2012, Manchester, UK, June 26‒29, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31364-6/pbk). Lecture Notes in Computer Science 7364. Lecture Notes in Artificial Intelligence, 530-536 (2012).
3
On constructor rewrite systems and the lambda calculus. (English)
Log. Methods Comput. Sci. 8, No. 3, Paper No. 12, 27 p., electronic only (2012).
4
Soundness of unravelings for conditional term rewriting systems via ultra-properties related to linearity. (English)
Log. Methods Comput. Sci. 8, No. 3, Paper No. 4, 49 p., electronic only (2012).
5
On the domain and dimension hierarchy of matrix interpretations. (English)
Bjørner, Nikolaj (ed.) et al., Logic for programming, artificial intelligence, and reasoning. 18th international conference, LPAR-18, Mérida, Venezuela, March 11‒15, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-28716-9/pbk). Lecture Notes in Computer Science 7180, 320-334 (2012).
6
Modes of convergence for term graph rewriting. (English)
Log. Methods Comput. Sci. 8, No. 2, Paper No. 6, 60 p., electronic only (2012).
7
Simulation techniques for the calculus of wrapped compartments. (English)
Theor. Comput. Sci. 431, 75-95 (2012).
8
Sufficient completeness verification for conditional and constrained TRS. (English)
J. Appl. Log. 10, No. 1, 127-143 (2012).
9
A reduction-preserving completion for proving confluence of non-terminating term rewriting systems. (English)
Log. Methods Comput. Sci. 8, No. 1, Paper No. 31, 29 p., electronic only (2012).
10
The exact hardness of deciding derivational and runtime complexity. (English)
Bezem, Marc (ed.), Computer science logic (CSL’11). 25th international workshop, 20th annual conference of the EACSL, Bergen, Norway, September 12‒15, 2011. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-32-3). LIPICS ‒ Leibniz International Proceedings in Informatics 12, 481-495, electronic only (2011).
11
A semantic approach to illative combinatory logic. (English)
Bezem, Marc (ed.), Computer science logic (CSL’11). 25th international workshop, 20th annual conference of the EACSL, Bergen, Norway, September 12‒15, 2011. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-32-3). LIPICS ‒ Leibniz International Proceedings in Informatics 12, 174-188, electronic only (2011).
12
Layer systems for proving confluence. (English)
Chakraborthy, Supraik (ed.) et al., IARCS annual conference on foundations of software technology and theoretical computer science (FSTTCS 2011), Mumbai, India, December 12‒14, 2011. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-34-7). LIPICS ‒ Leibniz International Proceedings in Informatics 13, 288-299, electronic only (2011).
13
Decreasing diagrams and relative termination. (English)
J. Autom. Reasoning 47, No. 4, 481-501 (2011).
14
Proving termination by dependency pairs and inductive theorem proving. (English)
J. Autom. Reasoning 47, No. 2, 133-160 (2011).
15
Labelings for decreasing diagrams. (English)
Schmid-Schauß, Manfred (ed.), 22nd international conference on rewriting techniques and applications (RTA 2011), Novi Sad, Serbia, May 30 ‒ June 1, 2011. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-30-9). LIPICS ‒ Leibniz International Proceedings in Informatics 10, 377-392, electronic only (2011).
16
Left-linear bounded trss are inverse recognizability preserving. (English)
Schmid-Schauß, Manfred (ed.), 22nd international conference on rewriting techniques and applications (RTA 2011), Novi Sad, Serbia, May 30 ‒ June 1, 2011. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-30-9). LIPICS ‒ Leibniz International Proceedings in Informatics 10, 361-376, electronic only (2011).
17
Type preservation as a confluence problem. (English)
Schmid-Schauß, Manfred (ed.), 22nd international conference on rewriting techniques and applications (RTA 2011), Novi Sad, Serbia, May 30 ‒ June 1, 2011. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-30-9). LIPICS ‒ Leibniz International Proceedings in Informatics 10, 345-360, electronic only (2011).
18
Modular and certified semantic labeling and unlabeling. (English)
Schmid-Schauß, Manfred (ed.), 22nd international conference on rewriting techniques and applications (RTA 2011), Novi Sad, Serbia, May 30 ‒ June 1, 2011. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-30-9). LIPICS ‒ Leibniz International Proceedings in Informatics 10, 329-344, electronic only (2011).
19
Program inversion for tail recursive functions. (English)
Schmid-Schauß, Manfred (ed.), 22nd international conference on rewriting techniques and applications (RTA 2011), Novi Sad, Serbia, May 30 ‒ June 1, 2011. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-30-9). LIPICS ‒ Leibniz International Proceedings in Informatics 10, 283-298, electronic only (2011).
20
Result 1 to 20 of 662 total
Start
Contact
Print
General Help
