33 search results - page 2 / 7 » First-Order Theorem Proving and Vampire |
JSYML
2010
14 years 5 months ago
2010
A set A of vertices of a graph G is called d-scattered in G if no two d-neighborhoods of (distinct) vertices of A intersect. In other words, A is d-scattered if no two distinct ver...
96
Voted
IJCAI
2003
15 years 5 days ago
2003
We overview the development of first-order automated reasoning systems starting from their early years. Based on the analysis of current and potential applications of such systems...
CADE
2007
Springer
15 years 11 months ago
2007
Springer
We present results of our work on using first order theorem proving to reason over a large ontology (the Suggested Upper Merged Ontology ? SUMO), and methods for making SUMO suita...
118
click to vote
LORI
2009
Springer
15 years 5 months ago
2009
Springer
Arrow’s Theorem is a central result in social choice theory. It states that, under certain natural conditions, it is impossible to aggregate the preferences of a finite set of i...
CADE
2007
Springer
15 years 11 months ago
2007
Springer
We present a method for proving rigid first order theorems by encoding them as propositional satisfiability problems. We encode the existence of a first order connection tableau an...