Martin Gebser

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Jori Bomanson

> Home > Persons > Martin Gebser

Publications

2016
[j15]
- view
  authority control:
- export record
  dblp key:
  - journals/fuin/BomansonGJKS16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/fuin/BomansonGJKS16
Jori Bomanson, Martin Gebser, Tomi Janhunen, Benjamin Kaufmann, Torsten Schaub:
Answer Set Programming Modulo Acyclicity. Fundam. Informaticae 147(1): 63-91 (2016)
[c75]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/iclp/BomansonGJ16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iclp/BomansonGJ16
Jori Bomanson, Martin Gebser, Tomi Janhunen:
Rewriting Optimization Statements in Answer-Set Programs. ICLP (Technical Communications) 2016: 5:1-5:15
2015
[c66]
- view
  authority control:
- export record
  dblp key:
  - conf/lpnmr/BomansonGJKS15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/lpnmr/BomansonGJKS15
Jori Bomanson, Martin Gebser, Tomi Janhunen, Benjamin Kaufmann, Torsten Schaub:
Answer Set Programming Modulo Acyclicity. LPNMR 2015: 143-150
2014
[c59]
- view
  authority control:
- export record
  dblp key:
  - conf/jelia/BomansonGJ14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/jelia/BomansonGJ14
Jori Bomanson, Martin Gebser, Tomi Janhunen:
Improving the Normalization of Weight Rules in Answer Set Programs. JELIA 2014: 166-180

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.