| 2007 |
|---|
| 24 | EE | Mariko Sasakura,
Susumu Yamasaki:
A Framework for Adaptive e-Learning Systems in Higher Education with Information Visualization.
IV 2007: 819-824 |
| 2006 |
|---|
| 23 | EE | Mariko Sasakura,
Kenichi Iwata,
Susumu Yamasaki:
An Interactive Environment for Generating Sequential Information.
IV 2006: 441-416 |
| 22 | EE | Susumu Yamasaki:
Logic programming with default, weak and strict negations.
TPLP 6(6): 737-749 (2006) |
| 2005 |
|---|
| 21 | EE | Kenichi Iwata,
Mariko Sasakura,
Susumu Yamasaki:
Visualization for Management of Electronics Product Composition.
IV 2005: 194-199 |
| 20 | EE | Susumu Yamasaki:
Logic Programming with Default, Weak and Strict Negations
CoRR abs/cs/0511041: (2005) |
| 2004 |
|---|
| 19 | EE | Mariko Sasakura,
Susumu Yamasaki:
Visualization with Hierarchically Structured Trees for an Explanation Reasoning System.
IV 2004: 893-898 |
| 2003 |
|---|
| 18 | EE | Susumu Yamasaki,
Mariko Sasakura:
An automated reasoning for diagnostic knowledge in a distributed environment.
ISICT 2003: 530-535 |
| 17 | EE | Mariko Sasakura,
Susumu Yamasaki:
A Three-Dimensional Visualization of Communications in Distributed Program Environments.
IV 2003: 132-137 |
| 16 | | Mariko Sasakura,
Susumu Yamasaki:
An Application of NaraView to Reasonings for Distributed Logic Programs.
PDPTA 2003: 1099-1105 |
| 2001 |
|---|
| 15 | EE | Susumu Yamasaki,
Yoshinori Kurose:
A sound and complete procedure for a general logic program in non-floundering derivations with respect to the 3-valued stable model semantics.
Theor. Comput. Sci. 266(1-2): 489-512 (2001) |
| 1998 |
|---|
| 14 | EE | Susumu Yamasaki,
Yoshinori Kurose:
Soudness of Abductive Proof Procedure with Respect to Constraint for Non-Ground Abducibles.
Theor. Comput. Sci. 206(1-2): 257-281 (1998) |
| 1996 |
|---|
| 13 | EE | Susumu Yamasaki:
SLDNF Resolution with Non-Safe Rule and Fixpoint Semantics for General Logic Programs.
Theor. Comput. Sci. 160(1&2): 283-303 (1996) |
| 1994 |
|---|
| 12 | | Susumu Yamasaki,
Kentaro Iida:
Transformation of Logic Programs to FP Programs Based on Dataflows.
J. Symb. Comput. 18(2): 157-182 (1994) |
| 11 | | Susumu Yamasaki:
A Denotational Semantics and Dataflow Construction for Logic Programs.
Theor. Comput. Sci. 124(1): 71-91 (1994) |
| 1991 |
|---|
| 10 | | Susumu Yamasaki:
Extraction of Functional from Logic Program.
PLILP 1991: 27-38 |
| 1990 |
|---|
| 9 | EE | Susumu Yamasaki:
Dataflow for Logic Program as Substitution Manipulator.
ISSAC 1990: 44-51 |
| 1989 |
|---|
| 8 | | Susumu Yamasaki:
Dataflow Programs for Parallel Computations of Logic Progams and their Semantics.
PARLE (2) 1989: 104-114 |
| 1988 |
|---|
| 7 | | Susumu Yamasaki:
Semantics of Logic Programs over Sequence Domains.
FGCS 1988: 382-388 |
| 1987 |
|---|
| 6 | | Susumu Yamasaki:
A Network of Communicating Logic Programs and Its Semantics.
IJCAI 1987: 24-29 |
| 5 | | Susumu Yamasaki,
Mikio Yoshida,
Shuji Doshita:
A Fixpoint Semantics of Horn Sentences Based on Substitution Sets.
Theor. Comput. Sci. 51: 309-324 (1987) |
| 1986 |
|---|
| 4 | | Susumu Yamasaki,
Shuji Doshita:
Resolution Deduction to Detect Satisfiability For Another Class Including Non-Horn Sentences In Propositional Logic.
Inf. Process. Lett. 23(4): 201-207 (1986) |
| 1984 |
|---|
| 3 | | Susumu Yamasaki,
Mikio Yoshida,
Shuji Doshita,
Mikito Hirata:
A New Combination of Input and Unit Deductions for Horn Sentences.
Inf. Process. Lett. 18(4): 209-213 (1984) |
| 2 | | Susumu Yamasaki,
Shuji Doshita:
Erratum: The Satisfiability Problem for a Class Consisting of Horn Sentences and Non-Horn Sentences in Proportional Logic
Information and Control 61(2): 174 (1984) |
| 1983 |
|---|
| 1 | | Susumu Yamasaki,
Shuji Doshita:
The Satisfiability Problem for a Class Consisting of Horn Sentences and Some Non-Horn Sentences in Proportional Logic
Information and Control 59(1-3): 1-12 (1983) |
