default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKhalil Djelloul
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
[j4]Khalil Djelloul:
A full first-order constraint solver for decomposable theories. Ann. Math. Artif. Intell. 56(1): 43-64 (2009)- [j3]Khalil Djelloul:
From decomposable to residual theories. Appl. Math. Comput. 215(5): 1761-1779 (2009) - [c14]Khalil Djelloul:
From exponential to almost linear decomposability of finite or infinite trees. SAC 2009: 897-902 - 2008
- [j2]Khalil Djelloul, Thi-Bich-Hanh Dao, Thom W. Frühwirth:
Theory of finite or infinite trees revisited. Theory Pract. Log. Program. 8(4): 431-489 (2008) - [c13]Khalil Djelloul:
A Full First-Order Constraint Solver for Decomposable Theories. AISC/MKM/Calculemus 2008: 93-108 - [c12]Khalil Djelloul:
An Efficient Decision Procedure for Functional Decomposable Theories Based on Dual Constraints. CSCLP 2008: 33-50 - [c11]Khalil Djelloul:
Combination of decomposability and propagation for solving first-order constraints in decomposable theories. SAC 2008: 1728-1732 - 2007
- [j1]Khalil Djelloul:
Decomposable theories. Theory Pract. Log. Program. 7(5): 583-632 (2007) - [c10]Marc Meister, Khalil Djelloul, Jacques Robin:
A Unified Semantics for Constraint Handling Rules in Transaction Logic. LPNMR 2007: 201-213 - [c9]Khalil Djelloul, Thi-Bich-Hanh Dao, Thom W. Frühwirth:
Toward a first-order extension of Prolog's unification using CHR: a CHR first-order constraint solver over finite or infinite trees. SAC 2007: 58-64 - [i2]Khalil Djelloul, Thi-Bich-Hanh Dao, Thom W. Frühwirth:
Theory of Finite or Infinite Trees Revisited. CoRR abs/0706.4323 (2007) - 2006
- [b1]Khalil Djelloul:
théories complètes autour des arbres. University of the Mediterranean, Marseille, France, 2006 - [c8]Khalil Djelloul, Thi-Bich-Hanh Dao:
Extension of First-Order Theories into Trees. AISC 2006: 53-67 - [c7]Thi-Bich-Hanh Dao, Khalil Djelloul:
Solving First-Order Constraints in the Theory of the Evaluated Trees. CSCLP 2006: 108-123 - [c6]Marc Meister, Khalil Djelloul, Thom W. Frühwirth:
Complexity of a CHR Solver for Existentially Quantified Conjunctions of Equations over Trees. CSCLP 2006: 139-153 - [c5]Thi-Bich-Hanh Dao, Khalil Djelloul:
Solving First-Order Constraints in the Theory of the Evaluated Trees. ICLP 2006: 423-424 - [c4]Khalil Djelloul, Thi-Bich-Hanh Dao:
Solving first-order constraints in the theory of finite or infinite trees: introduction to the decomposable theories. SAC 2006: 7-14 - [c3]Khalil Djelloul, Thi-Bich-Hanh Dao:
Complete First-Order Axiomatization of Finite or Infinite M-extended Trees. WLP 2006: 111-119 - [i1]Khalil Djelloul:
Decomposable Theories. CoRR abs/cs/0607065 (2006) - 2005
- [c2]Khalil Djelloul:
Complete First-Order Axiomatization of the Construction of Trees On an Ordered Set. FCS 2005: 87-93 - [c1]Khalil Djelloul:
About the Combination of Trees and Rational Numbers in a Complete First-Order Theory. FroCoS 2005: 106-121
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:24 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
