Skip to search formSkip to main contentSkip to account menu

Vampire Theorem Prover

Known as: Vampire (disambiguation), Theorem prover Vampire, Vampire reasoner 
Vampire's kernel implements the calculi of ordered binary resolution and superposition for handling equality. The splitting rule and negative… 
Wikipedia (opens in a new tab)

Related topics

Related topics

13 relations
Automated theorem provingCADE ATP System CompetitionConjunctive normal formDPLL algorithm

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
VAMPIRE - Analyse, observation et prévention de vulnérabilités dans l'Internet du futur - Compte-rendu de fin de projet
Internet est devenu le lieu de l'integration de nombreux services autrefois separes. Citons la telephonie filaire ou mobile. De… 
2013
2013
Peripheral Phenomena: The Colliding Evolution of Darcy and Dracula
In this study, I examine aspects of Jane Austen, vampire fiction, and contemporary culture through the lens of vampire adaptions… 
2012
2012
The homosexual vampire as a metaphor for…the homosexual vampire?' : True Blood, Homonormativity and Assimilation
2011
2011
The Twilight Saga
The story of The Twilight Saga centres around the relationship between the teenager Isabella "Bella" Swan, and her relationship… 
2010
2010
Interpolation and Symbol Elimination in Vampire
It has recently been shown that proofs in which some symbols are colored (e.g. local or split proofs and symbol-eliminating… 
2010
2010
English Assimilation and Invasion From Outside the Empire: Problems of the Outsider in England in Bram Stoker's Dracula
.........................................................................................iii DEDICATION… 
2010
2010
Metamorphoses of the Vampire in Literature and Film: The Bourgeois Vampire and Nineteenth-Century Identity Theft
Highly Cited
2005
Highly Cited
2005
MUP: a minimal unsatisfiability prover
  • Jinbo Huang
  • Proceedings of the ASP-DAC . Asia and South…
  • 2005
  • Corpus ID: 9278486
After establishing the unsatisfiability of a SAT instance encoding a typical design task, there is a practical need to identify… 
2005
2005
Resolution and Pebbling Games
We define a collection of Prover-Delayer games to characterise some subsystems of propositional resolution. We give some natural… 
1995
1995
SATCHMORE: SATCHMO with RElevancy
We introduce a relevancy detection algorithm to be used in conjunction with the SATCHMO prover. The version of SATCHMO considered… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)