Sciweavers

2035 search results - page 58 / 407
» On the complexity of stratified logics
Sort
View
JAPLL
2006
87views more  JAPLL 2006»
15 years 6 months ago
Is ZF a hack?: Comparing the complexity of some (formalist interpretations of) foundational systems for mathematics
This paper presents Automath encodings (which also are valid in LF/P) of various kinds of foundations of mathematics. Then it compares these encodings according to their size, to f...
Freek Wiedijk
SIAMCOMP
2000
86views more  SIAMCOMP 2000»
15 years 5 months ago
On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems
An exponential lower bound for the size of tree-like cutting planes refutations of a certain family of conjunctive normal form (CNF) formulas with polynomial size resolution refuta...
Maria Luisa Bonet, Juan Luis Esteban, Nicola Gales...
TJS
2002
101views more  TJS 2002»
15 years 5 months ago
Compilation for Adaptive Computing Systems Using Complex Parameterized Hardware Objects
FLAME, the Flexible API for Module-based Environments, is a proposed standard interface for the integration of parameterized hardware generators into high-level design tools. This ...
Andreas Koch
CADE
2006
Springer
16 years 6 months ago
Dynamic Logic with Non-rigid Functions
We introduce a dynamic logic that is enriched by non-rigid functions, i.e., functions that may change their value from state to state (during program execution), and we present a (...
Bernhard Beckert, André Platzer
ECSQARU
2009
Springer
16 years 22 days ago
An Algorithm for Generating Arguments in Classical Predicate Logic
Abstract. There are a number of frameworks for modelling argumentation in logic. They incorporate a formal representation of individual arguments and techniques for comparing conï¬...
Vasiliki Efstathiou, Anthony Hunter