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="Yamasaki, Susumu"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A sound and complete procedure for a general logic program in non-floundering derivations with respect to the 3-valued stable model semantics
Susumu Yamasaki
,
Yoshinori Kurose
Theoretical Computer Science
266
(1-2), 2001, pp. 489-512
Soundness of abductive proof procedure with respect to constraint for non-ground abducibles
Susumu Yamasaki
,
Yoshinori Kurose
Theoretical Computer Science
206
(1-2), 1998, pp. 257-281
SLDNF resolution with non-safe rule and fixpoint semantics for general logic programs
Susumu Yamasaki
Theoretical Computer Science
160
(1-2), 1996, pp. 283-303
Transformation of logic programs to FP programs based on dataflows
Susumu Yamasaki
,
Kentaro Iida
Journal Symbolic Computation
18
(2), 1994, pp. 157-182
A denotational semantics and dataflow construction for logic programs
Susumu Yamasaki
Theoretical Computer Science
124
(1), 1994, pp. 71-91
Recursion equation sets computing logic programs
Susumu Yamasaki
Theoretical Computer Science
76
, 1990, pp. 309-322
Dataflow for logic program as substitution manipulator
Susumu Yamasaki
Proceedings of the 1990 International Symposium on Symbolic and Algebraic Computation, ISSAC'90 (Tokyo, Japan, August 20-24, 1990)
, 1990, pp. 44-51
The Satisfiability Problem for a Class Consisting of Horn Sentences and Some Non-Horn Sentences in Proportional Logic
Susumu Yamasaki
,
Shuji Doshita
Information and Control
59
(1-3), 1983, pp. 1-12