Khalil Djelloul

According to our database1, Khalil Djelloul authored at least 17 papers between 2005 and 2009.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2009
From decomposable to residual theories.
Appl. Math. Comput., 2009

A full first-order constraint solver for decomposable theories.
Ann. Math. Artif. Intell., 2009

From exponential to almost linear decomposability of finite or infinite trees.
Proceedings of the 2009 ACM Symposium on Applied Computing (SAC), 2009

2008
Theory of finite or infinite trees revisited.
Theory Pract. Log. Program., 2008

Combination of decomposability and propagation for solving first-order constraints in decomposable theories.
Proceedings of the 2008 ACM Symposium on Applied Computing (SAC), 2008

An Efficient Decision Procedure for Functional Decomposable Theories Based on Dual Constraints.
Proceedings of the Recent Advances in Constraints, 2008

2007
Decomposable theories.
Theory Pract. Log. Program., 2007

Toward a first-order extension of Prolog's unification using CHR: a CHR first-order constraint solver over finite or infinite trees.
Proceedings of the 2007 ACM Symposium on Applied Computing (SAC), 2007

A Unified Semantics for Constraint Handling Rules in Transaction Logic.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2007

2006
théories complètes autour des arbres.
PhD thesis, 2006

Complete First-Order Axiomatization of Finite or Infinite M-extended Trees.
Proceedings of the 20th Workshop on Logic Programming, 2006

Solving first-order constraints in the theory of finite or infinite trees: introduction to the decomposable theories.
Proceedings of the 2006 ACM Symposium on Applied Computing (SAC), 2006

Solving First-Order Constraints in the Theory of the Evaluated Trees.
Proceedings of the Logic Programming, 22nd International Conference, 2006

Complexity of a CHR Solver for Existentially Quantified Conjunctions of Equations over Trees.
Proceedings of the Recent Advances in Constraints, 2006

Extension of First-Order Theories into Trees.
Proceedings of the Artificial Intelligence and Symbolic Computation, 2006

2005
About the Combination of Trees and Rational Numbers in a Complete First-Order Theory.
Proceedings of the Frontiers of Combining Systems, 5th International Workshop, 2005

Complete First-Order Axiomatization of the Construction of Trees On an Ordered Set.
Proceedings of The 2005 International Conference on Foundations of Computer Science, 2005


  Loading...