1888 search results - page 24 / 378 » Proof theory and computational analysis |
FOCS
1994
IEEE
15 years 4 months ago
1994
IEEE
93
Voted
BIRTHDAY
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. We present a new proof of axiomatic completeness for Proposition Temporal Logic (PTL) for discrete, linear time for both finite and infinite time (without past-time). T...
94
Voted
LICS
2008
IEEE
15 years 7 months ago
2008
IEEE
Using appropriate notation systems for proofs, cutreduction can often be rendered feasible on these notations. Explicit bounds can be given. Developing a suitable notation system ...
COCOON
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. We show that finding roots of Boolean matrices is an NPhard problem. This answers a twenty year old question from semigroup theory. Interpreting Boolean matrices as dire...
130
click to vote
AGP
2010
IEEE
15 years 5 months ago
2010
IEEE
We review the Italian contribution to proof-theoretic and higher-order extensions of logic programming; this originated from the realization that Horn clauses lacked standard abstr...