7988 search results - page 141 / 1598 » A Useful Undecidable Theory |
TACAS
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. Given a theory T and two formulas A and B jointly unsatisfiable in T , a theory interpolant of A and B is a formula I such that (i) its non-theory symbols are shared by ...
CSL
2009
Springer
14 years 4 months ago
2009
Springer
This paper investigates a methodology of using FM (Fraenkel-Mostowski) sets, and the ideas of nominal set theory, to adjoin name generation to a semantic theory. By developing a d...
FOSSACS
1998
Springer
14 years 2 months ago
1998
Springer
Abstract. Domain theory began in an attempt to provide mathematical models for high-level programming languages, an area where it has proved to be particularly useful. It is perhap...
CAV
2012
Springer
12 years 22 days ago
2012
Springer
Abstract. A minimum satisfying assignment of a formula is a minimumcost partial assignment of values to the variables in the formula that guarantees the formula is true. Minimum sa...
ICAIL
2009
ACM
14 years 4 months ago
2009
ACM
Argumentation annotation is a crucial step in applying machine learning techniques to the argumentation field. However, there exist few argumentation corpora and their developmen...