The following pages link to Susumu Yamasaki (Q920623):
Displaying 11 items.
- Recursion equation sets computing logic programs (Q920624) (← links)
- A new combination of input and unit deductions for Horn sentences (Q1057665) (← links)
- A fixpoint semantics of Horn sentences based on substitution sets (Q1100934) (← links)
- Soundness of abductive proof procedure with respect to constraint for non-ground abducibles (Q1274977) (← links)
- A denotational semantics and dataflow construction for logic programs (Q1318723) (← links)
- Transformation of logic programs to FP programs based on dataflows (Q1338343) (← links)
- SLDNF resolution with non-safe rule and fixpoint semantics for general logic programs (Q1350529) (← links)
- Resolution deduction to detect satisfiability for another class including non-Horn sentences in propositional logic (Q1819946) (← links)
- Logic programming with default, weak and strict negations (Q3422418) (← links)
- The satisfiabilty problem for a class consisting of horn sentences and some non-horn sentences in proportional logic (Q3677734) (← links)
- (Q4287468) (← links)
