P. Lincoln

From MaRDI portal
(Redirected from P. Lincoln)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
On Shostak's decision procedure for combinations of theories
Automated Deduction — Cade-13
2019-01-15Paper
A search-based procedure for nonlinear real arithmetic
Formal Methods in System Design
2017-03-28Paper
Two Decades of Maude
Lecture Notes in Computer Science
2015-09-14Paper
Analyzing Pathways Using SAT-Based Approaches
Algebraic Biology
2007-11-29Paper
Hybrid Systems: Computation and Control
Lecture Notes in Computer Science
2007-09-25Paper
All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
Lecture Notes in Computer Science
2007-08-08Paper
scientific article; zbMATH DE number 2043516 (Why is no real title available?)2004-02-16Paper
scientific article; zbMATH DE number 2043522 (Why is no real title available?)2004-02-16Paper
scientific article; zbMATH DE number 1962743 (Why is no real title available?)2003-08-11Paper
scientific article; zbMATH DE number 1962758 (Why is no real title available?)2003-08-11Paper
scientific article; zbMATH DE number 1950558 (Why is no real title available?)2003-07-17Paper
scientific article; zbMATH DE number 1950573 (Why is no real title available?)2003-07-17Paper
Maximizing sharing of protected information
Journal of Computer and System Sciences
2002-09-12Paper
Maude: specification and programming in rewriting logic
Theoretical Computer Science
2002-08-13Paper
Towards Maude 2. 02001-05-07Paper
Optimization complexity of linear logic proof games
Theoretical Computer Science
2000-08-23Paper
scientific article; zbMATH DE number 1231654 (Why is no real title available?)1999-01-07Paper
scientific article; zbMATH DE number 1231667 (Why is no real title available?)1999-01-07Paper
Probabilistic polynomial-time equivalence and security analysis
Lecture Notes in Computer Science
1999-01-01Paper
scientific article; zbMATH DE number 1231537 (Why is no real title available?)1998-12-20Paper
scientific article; zbMATH DE number 1231522 (Why is no real title available?)1998-12-13Paper
scientific article; zbMATH DE number 1163987 (Why is no real title available?)1998-11-01Paper
Linear Logic Proof Games and Optimization
The Bulletin of Symbolic Logic
1997-05-25Paper
Linear Logic Proof Games and Optimization
The Bulletin of Symbolic Logic
1997-05-25Paper
scientific article; zbMATH DE number 786491 (Why is no real title available?)1996-01-21Paper
Constant-only multiplicative linear logic is NP-complete
Theoretical Computer Science
1995-11-28Paper
scientific article; zbMATH DE number 786489 (Why is no real title available?)1995-10-31Paper
First-order linear logic without modalities is NEXPTIME-hard
Theoretical Computer Science
1995-01-11Paper
Linearizing intuitionistic implication
Annals of Pure and Applied Logic
1993-05-16Paper
Decision problems for propositional linear logic
Annals of Pure and Applied Logic
1992-09-27Paper
Adventures in associative-commutative unification
Journal of Symbolic Computation
1989-01-01Paper
scientific article; zbMATH DE number 4074540 (Why is no real title available?)1988-01-01Paper


Research outcomes over time


This page was built for person: P. Lincoln