Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Peter Hansen 0002

> Home > Persons

Person information

affiliation: University of Bremen, Faculty of Mathematics, Computer Science, Germany

Other persons with the same name

see FAQ

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

2020 – today

see FAQ

What is the meaning of the colors in the publication lists?

2020
[i2]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2011-09836
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2011-09836
Meghyn Bienvenu, Peter Hansen, Carsten Lutz, Frank Wolter:
First Order-Rewritability and Containment of Conjunctive Queries in Horn Description Logics. CoRR abs/2011.09836 (2020)

2010 – 2019

see FAQ

What is the meaning of the colors in the publication lists?

2018
[i1]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1804-06907
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1804-06907
Peter Hansen, Carsten Lutz:
Computing FO-Rewritings in EL in Practice: from Atomic to Conjunctive Queries. CoRR abs/1804.06907 (2018)
2017
[c6]
- view
  - electronic edition @ ceur-ws.org (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/dlog/0002L17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dlog/0002L17
Peter Hansen, Carsten Lutz:
Computing FO-Rewritings in EL in Practice: from Atomic to Conjunctive Queries. Description Logics 2017
[c5]
- view
  authority control:
- export record
  dblp key:
  - conf/semweb/HansenL17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/semweb/HansenL17
Peter Hansen, Carsten Lutz:
Computing FO-Rewritings in EL in Practice: From Atomic to Conjunctive Queries. ISWC (1) 2017: 347-363
2016
[c4]
- view
  - electronic edition @ ceur-ws.org (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/dlog/Bienvenu0LW16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dlog/Bienvenu0LW16
Meghyn Bienvenu, Peter Hansen, Carsten Lutz, Frank Wolter:
First Order-Rewritability and Containment of Conjunctive Queries in Horn Description Logics. Description Logics 2016
[c3]
- view
  - electronic edition @ ijcai.org (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/ijcai/Bienvenu0LW16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ijcai/Bienvenu0LW16
Meghyn Bienvenu, Peter Hansen, Carsten Lutz, Frank Wolter:
First Order-Rewritability and Containment of Conjunctive Queries in Horn Description Logics. IJCAI 2016: 965-971
2015
[c2]
- view
  - electronic edition @ ijcai.org (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/ijcai/0002LSW15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ijcai/0002LSW15
Peter Hansen, Carsten Lutz, Inanç Seylan, Frank Wolter:
Efficient Query Rewriting in the Description Logic EL and Beyond. IJCAI 2015: 3034-3040
2014
[c1]
- view
  - electronic edition @ ceur-ws.org (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/dlog/HansenLSW14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dlog/HansenLSW14
Peter Hansen, Carsten Lutz, Inanç Seylan, Frank Wolter:
Query Rewriting under EL TBoxes: Efficient Algorithms. Description Logics 2014: 197-208

a service of

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.