Sciweavers

446 search results - page 17 / 90
» Automating Theories in Intuitionistic Logic
Sort
View
87
Voted
JAIR
2011
103views more  JAIR 2011»
14 years 7 months ago
Automated Search for Impossibility Theorems in Social Choice Theory: Ranking Sets of Objects
We present a method for using standard techniques from satisfiability checking to automatically verify and discover theorems in an area of economic theory known as ranking sets o...
C. Geist, Ulrich Endriss
85
Voted
ASP
2001
Springer
15 years 5 months ago
Logic Programming Agents and Game Theory
In this paper we present a framework for logic programming agents to take part in games in such a way that stable models of the system, the ones agreed upon by all the members, co...
Marina De Vos, Dirk Vermeir
FLAIRS
2006
15 years 1 months ago
Automated Generation of Interesting Theorems
In the logical theory of a set of axioms there are many boring logical consequences, and scattered among them there are a few interesting ones. The few interesting ones include th...
Yury Puzis, Yi Gao, Geoff Sutcliffe
90
Voted
JIIS
2008
104views more  JIIS 2008»
15 years 12 days ago
A framework for checking proofs naturally
We propose a natural framework, called NF, which supports development of formal proofs on a computer. NF is based on a theory of Judgments and Derivations. NF is designed by observ...
Masahiko Sato
ITP
2010
165views Mathematics» more  ITP 2010»
15 years 4 months ago
A Mechanized Translation from Higher-Order Logic to Set Theory
Abstract. In order to make existing formalizations available for settheoretic developments, we present an automated translation of theories from Isabelle/HOL to Isabelle/ZF. This c...
Alexander Krauss, Andreas Schropp