Safa Yahi

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 Habiba Drias

> Home > Persons > Safa Yahi

Publications

2010
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/jar/BenferhatYD10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jar/BenferhatYD10
Salem Benferhat, Safa Yahi, Habiba Drias:
A New Default Theories Compilation for MSP-Entailment. J. Autom. Reason. 45(1): 39-59 (2010)
2008
[c4]
- view
  - electronic edition @ aaai.org (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/flairs/BenferhatYD08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/flairs/BenferhatYD08
Salem Benferhat, Safa Yahi, Habiba Drias:
On the Compilation of Possibilistic Default Theories. FLAIRS 2008: 613-618
2007
[c2]
- view
  - electronic edition @ ijcai.org (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/ijcai/BenferhatYD07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ijcai/BenferhatYD07
Salem Benferhat, Safa Yahi, Habiba Drias:
On the Compilation of Stratified Belief Bases under Linear and Possibilistic Logic Policies. IJCAI 2007: 2425-2430
2005
[c1]
- view
  authority control:
- export record
  dblp key:
  - conf/iwann/DriasSY05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iwann/DriasSY05
Habiba Drias, Souhila Sadeg, Safa Yahi:
Cooperative Bees Swarm for Solving the Maximum Weighted Satisfiability Problem. IWANN 2005: 318-325

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.