`Travelled to:`

1 × Australia

1 × Denmark

1 × Ireland

1 × Japan

1 × United Kingdom

2 × France

2 × Hungary

3 × Germany

3 × Italy

3 × USA

`Collaborated with:`

C.Sakama ∅ R.Hasegawa Y.Ohta M.Koshimura M.Banbara N.Tamura M.Völker T.Wakaki D.Martínez T.Ribeiro G.Alenyà C.Torras T.Soh T.Schaub D.Sykes D.Corapi J.Magee J.Kramer A.Russo

`Talks about:`

program (12) logic (7) set (6) abduct (5) disjunct (4) answer (4) model (4) extend (3) negat (3) theorem (2)

## Person: Katsumi Inoue

### DBLP: Inoue:Katsumi

### Contributed to:

### Wrote 21 papers:

- ICLP-2015-MartinezRIAT #learning #modelling #probability
- Learning Probabilistic Action Models from Interpretation Transitions (DM, TR, KI, GA, CT), pp. 114–127.
- ICLP-2015-VolkerI #automaton #logic programming
- Logic Programming for Cellular Automata (MV, KI), pp. 128–139.
- ICLP-J-2013-BanbaraSTIS #modelling #programming #set
- Answer set programming as a modeling language for course timetabling (MB, TS, NT, KI, TS), pp. 783–798.
- ICSE-2013-SykesCMKRI #adaptation #learning #modelling
- Learning revised models for planning in adaptive systems (DS, DC, JM, JK, AR, KI), pp. 63–71.
- ICLP-2012-BanbaraTI #generative #matrix #programming #testing
- Generating Event-Sequence Test Cases by Answer Set Programming with the Incidence Matrix (MB, NT, KI), pp. 86–97.
- ICLP-2006-InoueS #programming #set
- Generality Relations in Answer Set Programming (KI, CS), pp. 211–225.
- LOPSTR-2006-SakamaI #logic programming #source code
- Constructing Consensus Logic Programs (CS, KI), pp. 26–42.
- ICLP-2004-WakakiI #compilation #programming #set
- Compiling Prioritized Circumscription into Answer Set Programming (TW, KI), pp. 356–370.
- ICLP-2002-InoueS
- Disjunctive Explanations (KI, CS), pp. 317–332.
- CL-2000-Inoue #abduction
- A Simple Characterization of Extended Abduction (KI), pp. 718–732.
- CADE-1998-OhtaIH #on the #testing
- On the Relationship Between Non-Horn Magic Sets and Relevancy Testing (YO, KI, RH), pp. 333–348.
- KR-1998-InoueS #abduction #specification #transaction
- Specifying Transactions for Extended Abduction (KI, CS), pp. 394–405.
- CADE-1997-HasegawaIOK #bottom-up #proving #set #theorem proving #top-down
- Non-Horn Magic Sets to Incorporate Top-down Inference into Bottom-up Theorem Proving (RH, KI, YO, MK), pp. 176–190.
- JICSLP-1996-SakamaI #logic programming #representation #source code
- Representing Priorities in Logic Programs (CS, KI), pp. 82–96.
- ICLP-1995-SakamaI #abduction #deduction #reasoning
- The Effect of Partial Deduction in Abductive Reasoning (CS, KI), pp. 383–397.
- ICLP-1994-SakamaI #abduction #equivalence #logic programming #on the #source code
- On the Equivalence between Disjunctive and Abductive Logic Programs (CS, KI), pp. 489–503.
- KR-1994-InoueS #on the
- On Positive Occurrences of Negation as Failure (KI, CS), pp. 293–304.
- ICLP-1993-InoueS #abduction #logic programming #source code
- Transforming Abductive Logic Programs to Disjunctive Programs (KI, CS), pp. 335–353.
- ICLP-1993-SakamaI #logic programming #source code
- Negation in Disjunctive Logic Programs (CS, KI), pp. 703–719.
- CADE-1992-InoueKH #generative #proving #theorem proving
- Embedding Negation as Failure into a Model Generation Theorem Prover (KI, MK, RH), pp. 400–415.
- ICLP-1991-Inoue #logic programming #source code
- Extended Logic Programs with Default Assumptions (KI), pp. 490–504.