Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Peltier, Nicolas"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
First-order theorem proving: Foreword
Nicolas Peltier
,
Viorica Sofronie-Stokkermans
Journal Symbolic Computation
47
(9), 2012, pp. 1009-1010
Modular instantiation schemes
Mnacho Echenim
,
Nicolas Peltier
Information Processing Letters
111
(20), 2011, pp. 989-993
The first order theory of primal grammars is decidable
Nicolas Peltier
Theoretical Computer Science
323
(1-3), 2004, pp. 267-320
Extracting models from clause sets saturated under semantic refinements of the resolution rule
Nicolas Peltier
Information and Computation
181
(2), 2003, pp. 99-130
A calculus combining resolution and enumeration for building finite models
Nicolas Peltier
Journal Symbolic Computation
36
(1-2), 2003, pp. 49-77
Combining enumeration and deductive techniques in order to increase the class of constructible infinite models
Ricardo Caferra
,
Nicolas Peltier
Journal Symbolic Computation
29
(2), 2000, pp. 177-211
Increasing model building capabilities by constraint solving on terms with integer exponents
Nicolas Peltier
Journal Symbolic Computation
24
(1), 1997, pp. 59-101
Disc
_{Atinf}
: A general framework for implementing calculi and strategies
Christophe Bourely
,
Nicolas Peltier
Lecture Notes in Computer Science
1128
, 1996, pp. 34-45