13 research outputs found
Superposition and chaining for totally ordered divisible abelian groups
We present a calculus for first-order theorem proving in the presence of the axioms of totally ordered divisible abelian groups. The calculus extends previous superposition or chaining calculi for divisible torsion-free abelian groups and dense total orderings without endpoints. As its predecessors, it is refutationally complete and requires neither explicit inferences with the theory axioms nor variable overlaps. It offers thus an efficient way of treating equalities and inequalities between additive terms over, e.g., the rational numbers within a first-order theorem prover
The dimension of splines of arbitrary degree on a tetrahedral partition
We consider the linear space of piecewise polynomials in three variables which are globally smooth, i.e., trivariate splines. The splines are defined on a uniform tetrahedral partition , which is a natural generalization of the four-directional mesh. By using Bernstein-B{\´e}zier techniques, we establish formulae for the dimension of the splines of arbitrary degree
A custom designed density estimation method for light transport
We present a new Monte Carlo method for solving the global illumination problem in environments with general geometry descriptions and light emission and scattering properties. Current Monte Carlo global illumination algorithms are based on generic density estimation techniques that do not take into account any knowledge about the nature of the data points --- light and potential particle hit points --- from which a global illumination solution is to be reconstructed. We propose a novel estimator, especially designed for solving linear integral equations such as the rendering equation. The resulting single-pass global illumination algorithm promises to combine the flexibility and robustness of bi-directional path tracing with the efficiency of algorithms such as photon mapping
On the probability of rendezvous in graphs
In a simple graph without isolated nodes the following random experiment is carried out: each node chooses one of its neighbors uniformly at random. We say a rendezvous occurs if there are adjacent nodes and such that chooses and chooses ; the probability that this happens is denoted by . M{\'e}tivier \emph{et al.} (2000) asked whether it is true that for all -node graphs , where is the complete graph on nodes. We show that this is the case. Moreover, we show that evaluating for a given graph is a \numberP-complete problem, even if only -regular graphs are considered, for any
A Resolution Calculus for First-order Schemata
International audienceWe devise a resolution calculus that tests the satisfiability of infinite families of clause sets, called clause set schemata. For schemata of propositional clause sets, we prove that this calculus is sound, refutationally complete, and terminating. The calculus is extended to first-order clauses, for which termination is lost, since the satisfiability problem is not semi-decidable for nonpropositional schemata. The expressive power of the considered logic is strictly greater than the one considered in our previous work
Superposition and chaining for totally ordered divisible abelian groups
An extended abstract of this report has appeared in Rajeev Gore, Alexander Leitsch, and Tobias Nipkow, (eds.), Automated Reasoning, 1. International Joint Conference, IJCAR 2001, Siena (IT), June 18-22, 2001, LNAI 2083, p. 226-241, Springer-Verl.SIGLEAvailable from TIB Hannover: RR 1912(2001-2-001) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekDEGerman
Superposition and Chaining for Totally Ordered Divisible Abelian Groups
We present a calculus for first-order theorem proving in the presence of the axioms of totally ordered divisible abelian groups. The calculus extends previous superposition or chaining calculi for divisible torsion-free abelian groups and dense total orderings without endpoints. As its predecessors, it is refutationally complete and requires neither explicit inferences with the theory axioms nor variable overlaps. It offers thus an efficient way of treating equalities and inequalities between additive terms over, e.g., the rational numbers within a first-order theorem prover
Superposition and Chaining for Totally Ordered Divisible Abelian Groups (Extended Abstract)
We present a calculus for first-order theorem proving in the presence of the axioms of totally ordered divisible abelian groups. The calculus extends previous superposition or chaining calculi for divisible torsion-free abelian groups and dense total orderings without endpoints. As its predecessors, it is refutationally complete and requires neither explicit inferences with the theory axioms nor variable overlaps. It offers thus an efficient way of treating equalities and inequalities between additive terms over, e.g., the rational numbers within a first-order theorem prover