Sciweavers

57 search results - page 9 / 12
» A Mechanized Translation from Higher-Order Logic to Set Theo...
Sort
View
POPL
2010
ACM
15 years 7 months ago
Dependent Types from Counterexamples
d by recent research in abstract model checking, we present a new approach to inferring dependent types. Unlike many of the existing approaches, our approach does not rely on prog...
Tachio Terauchi
FTRTFT
1998
Springer
15 years 1 months ago
On the Need for Practical Formal Methods
A controversial issue in the formal methods community is the degree to which mathematical sophistication and theorem proving skills should be needed to apply a formal method. A fun...
Constance L. Heitmeyer
LOGCOM
2008
94views more  LOGCOM 2008»
14 years 9 months ago
Preservation of Interpolation Features by Fibring
Fibring is a metalogical constructor that permits to combine different logics by operating on their deductive systems under certain natural restrictions, as for example that the t...
Walter Alexandre Carnielli, João Rasga, Cri...
CP
2007
Springer
15 years 3 months ago
Propagation = Lazy Clause Generation
Finite domain propagation solvers effectively represent the possible values of variables by a set of choices which can be naturally modelled as Boolean variables. In this paper we...
Olga Ohrimenko, Peter J. Stuckey, Michael Codish
ATAL
2007
Springer
15 years 3 months ago
Reasoning about judgment and preference aggregation
Agents that must reach agreements with other agents need to reason about how their preferences, judgments, and beliefs might be aggregated with those of others by the social choic...
Thomas Ågotnes, Wiebe van der Hoek, Michael ...