2948 articles  [english version]
.:. Consultation > Liste par discipline > Logique en informatique .:.
26 documents classés par :
1 - 2 Page Suivante Page Finale
fulltext access Computing in the fractal cloud: modular generic solvers for SAT and Q-SAT variants.
Duchier D., Durand-Lose J., Senot M.
In Proceedings of the 9th international conference on Theory and Applications of Models of Computation (TAMC 2012) - Theory and Applications of Models of Computation (TAMC 2012), China (2012) [hal-00673603 - version 1]
fulltext access Abstract geometrical computation 7: Geometrical accumulations and computably enumerable real numbers
Durand-Lose J.
Natural Computing 11, 4 (2012) 609-622 [hal-00691466 - version 1]
fulltext access Abstract geometrical computation 6: a reversible, conservative and rational based model for black hole computation
Durand-Lose J.
International Journal of Unconventional Computing 8, 1 (2012) 33-46 [hal-00511224 - version 1]
fulltext access Environnement pour le développement et la preuve de correction systèmatiques de programmes parallèles fonctionnels
Tesson J.
Université d'Orléans (08/11/2011), Frédéric Loulergue (Dir.) [tel-00660554 - version 3]		 STAR - Dépôt national des thèses électroniques
fulltext access Geometrical accumulations and computably enumerable real numbers (extended abstract)
Durand-Lose J.
in Int. Conf. Unconventional Computation 2011 - UC '11, Finland (2011) [hal-00601746 - version 1]
fulltext access Solving Q-SAT in bounded space and time by geometrical computation
Duchier D., Durand-Lose J., Senot M.
In CiE '11 (abstracts and handout booklet) - Models of computability in context, 7th Int. Conf. Computability in Europe, Bulgaria (2011) [hal-00605661 - version 1]
fulltext access Characterizing Conclusive Approximations by Logical Formulae
Boichut Y., Dao T.-B.-H., Murat V.
Reachability Problems 2011, Italy (2011) [inria-00606100 - version 1]
fulltext access Abstract geometrical computation 5: embedding computable analysis
Durand-Lose J.
Natural Computing 10, 4 (2011) 1261-1273 [hal-00454605 - version 1]
fulltext access Massively Parallel Automata in Euclidean Space-Time
Duchier D., Durand-Lose J., Senot M.
Dans IEEE 4th International Conference on Self-Adaptive and Self-Organizing Systems Workshops (SASOW~'10) - IEEE 4th International Conference on Self-Adaptive and Self-Organizing Systems Workshops (SASOW~'10): Spatial Computing Workshop (SCW '10), Hongrie (2010) [hal-00511958 - version 1]
fulltext access A model-theoretic framework for grammaticality judgements
Duchier D., Prost J.-P., Dao T.-B.-H.
In Conference on Formal Grammar (FG2009) - Conference on Formal Grammar (FG2009), France (2009) [hal-00458937 - version 1]
fulltext access Abstract geometrical computation 3: Black holes for classical and analog computing
Durand-Lose J.
Natural Computing 8, 3 (2009) 455-472 [hal-00447966 - version 1]
fulltext access Abstract Geometrical Computation and Computable Analysis
Durand-Lose J.
In International Conference on Unconventional Computation 2009 (UC~'09) - International Conference on Unconventional Computation 2009 (UC~'09), Portugal (2009) [hal-00447965 - version 1]
fulltext access Compression vs Queryability - A Case Study
Anantharaman S.
In Structure-Based Compression of Complex Massive Data - Dagstuhl Seminar 08621, Germany (2008) [inria-00449563 - version 1]
fulltext access Abstract geometrical computation with accumulations: Beyond the Blum, Shub and Smale model
Durand-Lose J.
Dans Logic and Theory of Algorithms - 4th Conf. Computability in Europe (CiE~'08) (abstracts and extended abstracts of unpublished papers), Grèce (2008) [hal-00448746 - version 1]
fulltext access Theory of Finite or Infinite Trees Revisited
Djelloul K., Dao T.-B.-H., Fruehwirth T.
Theory and Practice of Logic Programming (2008) 8(4):1-60 [hal-00202312 - version 1]
fulltext access Solving First-Order Constraints in the Theory of the Evaluated Trees
Dao T.-B.-H., Djelloul K.
in Solving First-Order Constraints in the Theory of the Evaluated Trees - Recent Advance in constraints. Lecture notes in computer science. Selected revised paper Csclp 2006., France (2007) [hal-00202314 - version 1]
fulltext access Toward a first-order extension of Prolog's unification using CHR
Djelloul K., Dao T.-B.-H., Fruehwirth T.
Dans ACM Symposium on applied computing - ACM symposium on applied computing, Corée, République Populaire Démocratique De (2007) [hal-00202316 - version 1]
fulltext access A unified sematics for CHR in transaction logic.
Meister M., Djelloul K., Robin J.
in The 9th International Conference on Logic Programming and Nonmonotonic Reasoning - LPNMR 07, United States (2007) [hal-00202315 - version 1]
fulltext access Complexity of a CHR solver for existentially quantified conjunctions of equations over trees.
Meister M., Djelloul K., Fruehwirth T.
Dans Complexity of a CHR solver for existentially quantified conjunctions of equations over trees. - Recent advances in constraints Lecture notes in computer science. Revised selected paper csclp 2006., France (2007) [hal-00202313 - version 1]
fulltext access Extension into trees of first order theories
Djelloul K., Dao T.-B.-H.
In lecture notes in artificial intelligence - The 8th International conference on artificial intelligence and symbolic computation, China (2006) [hal-00202317 - version 1]