• PITA

  • Referenced in 19 articles [sw06950]
  • PITA system: tabling and answer subsumption for reasoning under uncertainty. Many real world domains require ... PRISM system reduces the complexity of query answering by restricting the form of programs ... programs. PITA relies on tabling with answer subsumption and consists of a transformation along with ... library functions that interface with answer subsumption. We show that, by adapting its transformation...
  • PULi

  • Referenced in 1 article [sw28623]
  • enumeration of justifications that uses resolution with answer literals instead of SAT solvers. In comparison ... compute all justifications for all entailed concept subsumptions in one of the largest commonly used...
  • SETHEO

  • Referenced in 119 articles [sw00707]
  • SETHEO: A high-performance theorem prover. The paper...
  • RuleML

  • Referenced in 22 articles [sw01792]
  • The goal of the Rule Markup Initiative is...
  • GOLOG

  • Referenced in 170 articles [sw02159]
  • GOLOG: A logic programming language for dynamic domains...
  • OTTER

  • Referenced in 314 articles [sw02904]
  • Our current automated deduction system Otter is designed...
  • VAMPIRE

  • Referenced in 239 articles [sw02918]
  • Vampire 8.0, [RV02,Vor05] is an automatic theorem...
  • TPTP

  • Referenced in 378 articles [sw04143]
  • The TPTP (Thousands of Problems for Theorem Provers...
  • Darwin

  • Referenced in 25 articles [sw04175]
  • Darwin is an automated theorem prover for first...
  • SATO

  • Referenced in 196 articles [sw04451]
  • SATO: A Solver for Propositional Satisfiability: The Davis...
  • JBool

  • Referenced in 105 articles [sw06185]
  • This software promotes some general and useful tools...
  • SATCHMO

  • Referenced in 96 articles [sw06619]
  • SATCHMO: a theorem prover implemented in Prolog. The...
  • Chaff

  • Referenced in 570 articles [sw06916]
  • Chaff:engineering an efficient SAT solver. Boolean Satisfiability...
  • BerkMin

  • Referenced in 160 articles [sw06917]
  • BerkMin: A fast and robust SAT-solver. We...
  • ProbLog

  • Referenced in 83 articles [sw06945]
  • ProbLog is a probabilistic logic programming language based...
  • CP-logic

  • Referenced in 17 articles [sw06947]
  • CP-logic: A language of causal probabilistic events...
  • B-Prolog

  • Referenced in 17 articles [sw06949]
  • B-Prolog is a high-performance implementation of...
  • Pellet

  • Referenced in 92 articles [sw07019]
  • Pellet: OWL 2 Reasoner for Java. For applications...
  • SPARQL

  • Referenced in 129 articles [sw07429]
  • Federation and navigation in SPARQL 1.1. SPARQL is...