7988 search results - page 225 / 1598 » A Useful Undecidable Theory |
100
Voted
CONCUR
2009
Springer
15 years 7 months ago
2009
Springer
Nondeterministic weighted automata are finite automata with numerical weights on transitions. They define quantitative languages L that assign to each word w a real number L(w). ...
111
Voted
APLAS
2005
ACM
15 years 6 months ago
2005
ACM
Interpretation interpretation is a theory of effective abstraction and/or approximation of discrete mathematical structures as found in the semantics of programming languages, mod...
100
click to vote
ECCC
2006
15 years 21 days ago
2006
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
116
click to vote
RULEML
2009
Springer
15 years 7 months ago
2009
Springer
We present the design and implementation of SPINdle – an open source Java based defeasible logic reasoner capable to perform efficient and scalable reasoning on defeasible logic...
119
Voted
ESOP
2008
Springer
15 years 2 months ago
2008
Springer
This paper defines the cover of a formula with respect to a set of variables V in theory T to be the strongest quantifier-free formula that is implied by V : in theory T. Cover e...