We describe Goéland, an automated theorem prover for firstorder logic that relies on a
concurrent search procedure to find tableau proofs, with concurrent processes …

This chapter surveys the research in parallel or distributed strategies for mechanical
theorem proving in first-order logic, and explores some of its connections with the research …

This work studies how grid and cloud computing can be applied to efficiently solving
propositional satisfiability problem (SAT) instances. Propositional logic provides a …

Reasoning over ontologies is a hard task where the efficiency in terms of time usually
depends on the ontology expressivity and the reasoner used. Depending on the domain and …

LeoPARD supports the implementation of knowledge representation and reasoning tools for
higher-order logic (s). It combines a sophisticated data structure layer (polymorphically typed …

This paper introduces a pseudo-concurrent architecture for first-order saturation-based
theorem provers with the eventual aim of develo** it into a truly concurrent architecture …

Different reasoning systems have different strengths and weaknesses, and often it is useful
to combine these systems to gain as much as possible from their strengths and retain as little …

Abstract The Semantic Web is commonly perceived as a web of partially interlinked machine
readable data. This data is inherently distributed and resembles the structure of the web in …

This article presents the results of research conducted on cluster systems with multicore
nodes to create a method and an algorithm that implement parallel inference in the proof of …

Abstract Satisfiability Modulo Theories (SMT) is an extension of the propositional
satisfiability problem (SAT) to other, well-chosen (first-order) theories such as integers, reals …