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: Journal=Inf.~Comput. AND Volume=199
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Superposition with equivalence reasoning and delayed clause normal form transformation
Harald Ganzinger
,
Jürgen Stuber
Information and Computation
199
(1-2), 2005, pp. 3-23
Translation of resolution proofs into short first-order proofs without choice axioms
Hans de Nivelle
Information and Computation
199
(1-2), 2005, pp. 24-54
Mechanising first-order temporal resolution
Boris Konev
,
Anatoli Degtyarev
,
Clare Dixon
,
Michael Fisher
,
Ullrich Hustadt
Information and Computation
199
(1-2), 2005, pp. 55-86
Canonization for disjoint unions of theories
Sava Krstić
,
Sylvain Conchon
Information and Computation
199
(1-2), 2005, pp. 87-106
A randomized satisfiability procedure for arithmetic and uninterpreted function symbols
Sumit Gulwani
,
George C. Necula
Information and Computation
199
(1-2), 2005, pp. 107-131
The complexity of finite model reasoning in description logics
Carsten Lutz
,
Ulrike Sattler
,
Lidia Tendera
Information and Computation
199
(1-2), 2005, pp. 132-171
Automating the dependency pair method
Nao Hirokawa
,
Aart Middeldorp
Information and Computation
199
(1-2), 2005, pp. 172-199
Proving pointer programs in higher-order logic
Farhad Mehta
,
Tobias Nipkow
Information and Computation
199
(1-2), 2005, pp. 200-227
Efficient instance retrieval with standard and relational path indexing
Alexandre Riazanov
,
Andrei Voronkov
Information and Computation
199
(1-2), 2005, pp. 228-252