2022 search results - page 65 / 405 » Complexity of Non-Monotonic Logics |
85
Voted
CORR
2007
Springer
15 years 19 days ago
2007
Springer
We propose two alternatives to Xu’s axiomatization of Chellas’s STIT. The first one simplifies its presentation, and also provides an alternative axiomatization of the delib...
112
Voted
JAPLL
2006
15 years 19 days ago
2006
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...
113
click to vote
SIAMCOMP
2000
15 years 13 days ago
2000
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...
106
Voted
TJS
2002
15 years 9 days ago
2002
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 ...
80
Voted
CADE
2006
Springer
16 years 29 days ago
2006
Springer
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 (...