| 2009 |
|---|
| 62 | EE | Chiaki Sakama,
Katsumi Inoue:
Equivalence issues in abduction and induction.
J. Applied Logic 7(3): 318-328 (2009) |
| 2008 |
|---|
| 61 | EE | Chiaki Sakama:
Negotiation by induction.
AAMAS (3) 2008: 1459-1462 |
| 60 | EE | Chiaki Sakama:
Inductive Negotiation in Answer Set Programming.
DALT 2008: 143-160 |
| 59 | EE | Katsumi Inoue,
Chiaki Sakama:
Comparing Abductive Theories.
ECAI 2008: 35-39 |
| 58 | EE | Chiaki Sakama,
Katsumi Inoue:
Brave Induction.
ILP 2008: 261-278 |
| 57 | EE | Chiaki Sakama,
Katsumi Inoue:
Coordination in answer set programming.
ACM Trans. Comput. Log. 9(2): (2008) |
| 2007 |
|---|
| 56 | | Katsumi Inoue,
Chiaki Sakama:
Generality and Equivalence Relations in Default Logic.
AAAI 2007: 434-439 |
| 55 | EE | Chiaki Sakama,
Katsumi Inoue:
Negotiation by abduction and relaxation.
AAMAS 2007: 242 |
| 2006 |
|---|
| 54 | | Martin Caminada,
Chiaki Sakama:
On the Existence of Answer Sets in Normal Extended Logic Programs.
ECAI 2006: 743-744 |
| 53 | EE | Katsumi Inoue,
Chiaki Sakama:
Generality Relations in Answer Set Programming.
ICLP 2006: 211-225 |
| 52 | EE | Chiaki Sakama,
Katsumi Inoue:
Constructing Consensus Logic Programs.
LOPSTR 2006: 26-42 |
| 51 | EE | Katsumi Inoue,
Chiaki Sakama:
Abductive Equivalence in First-order Logic.
Logic Journal of the IGPL 14(2): 333-346 (2006) |
| 2005 |
|---|
| 50 | EE | Chiaki Sakama,
Katsumi Inoue:
Combining Answer Sets of Nonmonotonic Logic Programs.
Answer Set Programming 2005 |
| 49 | EE | Chiaki Sakama,
Katsumi Inoue:
Combining Answer Sets of Nonmonotonic Logic Programs.
CLIMA VI 2005: 320-339 |
| 48 | EE | Katsumi Inoue,
Chiaki Sakama:
Equivalence in Abductive Logic.
IJCAI 2005: 472-477 |
| 47 | EE | Chiaki Sakama,
Katsumi Inoue:
Inductive Equivalence of Logic Programs.
ILP 2005: 312-329 |
| 46 | EE | Chiaki Sakama:
Induction from answer sets in nonmonotonic logic programs.
ACM Trans. Comput. Log. 6(2): 203-231 (2005) |
| 45 | EE | Chiaki Sakama:
Ordering default theories and nonmonotonic logic programs.
Theor. Comput. Sci. 338(1-3): 127-152 (2005) |
| 2004 |
|---|
| 44 | EE | Chiaki Sakama,
Katsumi Inoue:
Coordination Between Logical Agents.
CLIMA V 2004: 161-177 |
| 43 | EE | Katsumi Inoue,
Chiaki Sakama:
Equivalence of Logic Programs Under Updates.
JELIA 2004: 174-186 |
| 42 | EE | Toshiko Wakaki,
Katsumi Inoue,
Chiaki Sakama,
Katsumi Nitta:
The PLP System.
JELIA 2004: 706-709 |
| 41 | EE | Chiaki Sakama,
Katsumi Inoue:
An Abductive Framework For Computing Knowledge Base Updates
CoRR cs.DB/0405076: (2004) |
| 2003 |
|---|
| 40 | EE | Ken-ichi Maeda,
Chiaki Sakama:
Discovery of Cellular Automata Rules Using Cases.
Discovery Science 2003: 360-368 |
| 39 | | Chiaki Sakama:
Ordering Default Theories.
IJCAI 2003: 839-846 |
| 38 | EE | Toshiko Wakaki,
Katsumi Inoue,
Chiaki Sakama,
Katsumi Nitta:
Computing Preferred Answer Sets in Answer Set Programming.
LPAR 2003: 259-273 |
| 37 | | Chiaki Sakama,
Katsumi Inoue:
An abductive framework for computing knowledge base updates.
TPLP 3(6): 671-713 (2003) |
| 2002 |
|---|
| 36 | EE | Katsumi Inoue,
Chiaki Sakama:
Disjunctive Explanations.
ICLP 2002: 317-332 |
| 35 | EE | Chiaki Sakama:
Towards the Integration of Inductive and Nonmonotonic Logic Programming.
Progress in Discovery Science 2002: 178-188 |
| 2001 |
|---|
| 34 | EE | Chiaki Sakama:
Learning by Answer Sets.
Answer Set Programming 2001 |
| 33 | EE | Chiaki Sakama:
Nonmonotonic Inductive Logic Programming.
LPNMR 2001: 62-80 |
| 2000 |
|---|
| 32 | | Chiaki Sakama,
Katsumi Inoue,
Koji Iwanuma,
Ken Satoh:
A Defeasible Reasoning System in Multi-Agent Environment.
CL-2000 Workshop on Computational Logic in Multi-Agent Systems 2000: 1-6 |
| 31 | | Ken Satoh,
Katsumi Inoue,
Koji Iwanuma,
Chiaki Sakama:
Speculative Computation by Abduction under Incomplete Communication Environments.
ICMAS 2000: 263-270 |
| 30 | EE | Chiaki Sakama:
Inverse Entailment in Nonmonotonic Logic Programs.
ILP 2000: 209-224 |
| 29 | EE | Chiaki Sakama,
Katsumi Inoue:
Prioritized logic programming and its application to commonsense reasoning.
Artif. Intell. 123(1-2): 185-222 (2000) |
| 28 | | Chiaki Sakama,
Katsumi Inoue:
Abductive logic programming and disjunctive logic programming: their relationship and transferability.
J. Log. Program. 44(1-3): 75-100 (2000) |
| 1999 |
|---|
| 27 | | Katsumi Inoue,
Chiaki Sakama:
Abducing Priorities to Derive Intended Conclusions.
IJCAI 1999: 44-49 |
| 26 | EE | Chiaki Sakama:
Some Properties of Invers Resolution in Normal Logic Programs.
ILP 1999: 279-290 |
| 25 | EE | Chiaki Sakama,
Katsumi Inoue:
Updating Extended Logic Programs through Abduction.
LPNMR 1999: 147-161 |
| 24 | | Katsumi Inoue,
Chiaki Sakama:
Computing Extended Abduction Through Transaction Programs.
Ann. Math. Artif. Intell. 25(3-4): 339-367 (1999) |
| 1998 |
|---|
| 23 | | Katsumi Inoue,
Chiaki Sakama:
Specifying Transactions for Extended Abduction.
KR 1998: 394-405 |
| 22 | | Katsumi Inoue,
Chiaki Sakama:
Negation as Failure in the Head.
J. Log. Program. 35(1): 39-78 (1998) |
| 1997 |
|---|
| 21 | | Chiaki Sakama,
Hirohisa Seki:
Partial Deduction in Disjunctive Logic Programming.
J. Log. Program. 32(3): 229-245 (1997) |
| 1996 |
|---|
| 20 | | Chiaki Sakama,
Katsumi Inoue:
Representing Priorities in Logic Programs.
JICSLP 1996: 82-96 |
| 19 | | Katsumi Inoue,
Chiaki Sakama:
A Fixpoint Characterization of Abductive Logic Programs.
J. Log. Program. 27(2): 107-136 (1996) |
| 1995 |
|---|
| 18 | | Chiaki Sakama,
Katsumi Inoue:
The Effect of Partial Deduction in Abductive Reasoning.
ICLP 1995: 383-397 |
| 17 | | Katsumi Inoue,
Chiaki Sakama:
Abductive Framework for Nonmonotonic Theory Change.
IJCAI 1995: 204-210 |
| 16 | | Chiaki Sakama,
Katsumi Inoue:
Embedding Circumscriptive Theories in General Disjunctive Programs.
LPNMR 1995: 344-357 |
| 15 | | Chiaki Sakama,
Katsumi Inoue:
Paraconsistent Stable Semantics for Extended Disjunctive Programs.
J. Log. Comput. 5(3): 265-285 (1995) |
| 1994 |
|---|
| 14 | | Chiaki Sakama,
Katsumi Inoue:
On the Equivalence between Disjunctive and Abductive Logic Programs.
ICLP 1994: 489-503 |
| 13 | | Katsumi Inoue,
Chiaki Sakama:
On Positive Occurrences of Negation as Failure.
KR 1994: 293-304 |
| 12 | | Chiaki Sakama,
Hirohisa Seki:
Partial Deduction of Disjunctive Logic Programs: A Declarative Approach.
LOPSTR 1994: 170-182 |
| 11 | | Chiaki Sakama,
Katsumi Inoue:
An Alternative Approach to the Semantics of Disjunctive Logic Programs and Deductive Databases.
J. Autom. Reasoning 13(1): 145-172 (1994) |
| 1993 |
|---|
| 10 | | Katsumi Inoue,
Chiaki Sakama:
Transforming Abductive Logic Programs to Disjunctive Programs.
ICLP 1993: 335-353 |
| 9 | | Chiaki Sakama,
Katsumi Inoue:
Negation in Disjunctive Logic Programs.
ICLP 1993: 703-719 |
| 8 | | Chiaki Sakama,
Katsumi Inoue:
Relating Disjunctive Logic Programs to Default Theories.
LPNMR 1993: 266-282 |
| 1992 |
|---|
| 7 | | Chiaki Sakama:
Extended Well-Founded Semantics for Paraconsistent Logic Programs.
FGCS 1992: 592-599 |
| 1990 |
|---|
| 6 | | Chiaki Sakama:
Possible Model Semantics for Disjunctive Databases II (Extended Abstract).
LPNMR 1990: 107-114 |
| 1989 |
|---|
| 5 | | Chiaki Sakama:
Possible Model Semantics for Disjunctive Databases.
DOOD 1989: 369-383 |
| 1988 |
|---|
| 4 | | Chiaki Sakama,
Hidenori Itoh:
Handling Knowledge by its Representative.
Expert Database Conf. 1988: 551-565 |
| 3 | | Chiaki Sakama,
Akira Okumura:
Nonmonotonic Parallel Inheritance Network.
LP 1988: 53-66 |
| 2 | | Chiaki Sakama,
Hidenori Itoh:
Partial Evaluation of Queries in Deductive Databases.
New Generation Comput. 6(2&3): 249-258 (1988) |
| 1987 |
|---|
| 1 | EE | Hidenori Itoh,
Masaaki Abe,
Chiaki Sakama,
Yuji Mitomo:
Parallel Control Techniques for Dedicated Relational Database Engines.
ICDE 1987: 208-215 |
