Gribomont, P. (2017). A favourable mathematical point of view on Aristotelian and Scholastic syllogisms. In Mathematics in Philosophy. Chromatika. |
Demaret, J.-N., Van Lishout, F., & Gribomont, P. (2008). Hierarchical Planning and Learning for Automatic Solving of Sokoban Problems [Paper presentation]. 20th Belgium-Netherlands Conference on Artificial Intelligence, Enschede, Netherlands. |
Gochet, P., & Gribomont, P. (2006). Epistemic Logic. In D. Gabbay & J. Woods (Eds.), Handbook of the History of Logic, vol. 7 (pp. 99-195). Amsterdam, Netherlands: Elsevier. |
Van Lishout, F., & Gribomont, P. (2006). Single-player games: introduction to a new solving method combining classical state-space modelling with a multi-agent representation [Paper presentation]. 18th Belgium-Netherlands Conference on Artificial Intelligence, Namur, Belgium. |
Fontaine, P., & Gribomont, P. (2005). Combining Non-stably Infinite, Non-first Order Theories. Electronic Notes in Theoretical Computer Science, 125 (3), 37-51. doi:10.1016/j.entcs.2004.06.066 |
Gochet, P., Gribomont, P., & Rossetto, D. (2005). Algorithms for Relevant Logic. In D. Vanderveken (Ed.), Logic, Thought and Action (pp. 479-496). Berlin, Germany: Springer. |
Gochet, P., & Gribomont, P. (2004). Applied Logics for Computer Science. In P. Weingartner (Ed.), Alternative Logics. Do Sciences Nedd Them? (pp. 177-203). Berlin, Germany: Springer. |
Fontaine, P., & Gribomont, P. (2003). Decidability of invariant validation for paramaterized systems. Lecture Notes in Computer Science, 2619, 97–112. doi:10.1007/3-540-36577-x_8 |
Gochet, P., Gribomont, P., & Thayse, A. (2000). Logique : méthodes pour l'intelligence artificielle. Paris, France: Hermès. |
Gribomont, P. (2000). Simplification of boolean verification conditions. Theoretical Computer Science, 239 (1), 165-185. doi:10.1016/S0304-3975(99)00217-0 |
Gribomont, P. (2000). Eléments de programmation en Scheme. Paris, France: Dunod. |
Gribomont, P., & Salloum, N. (1999). Using OBDD's for the Validation of Skolem Verification Conditions. In Automated Deduction-CADE-16 (pp. 222). Springer. |
Gribomont, P., & Zenner, G. (1998). Automated verification of szymanski's algorithm. In Tools and Algorithms for the Construction and Analysis of Systems (pp. 424-438). Springer. |
Gribomont, P. (1996). Preprocessing for invariant validation. In Algebraic Methodology and Software Technology (pp. 256-270). Springer. |
Gribomont, P. (1996). Atomicity refinement and trace reduction theorems. In Computer Aided Verification (pp. 311-322). Springer. |
Gochet, P., Gribomont, P., & Rossetto, D. (1995). Algorithms for relevant logic. Logique et Analyse, 38 (150-152), 329-346. |
Gribomont, P., & Rossetto, D. (1995). CAVEAT: technique and tool for computer aided verification and transformation. In Computer Aided Verification (pp. 70-83). Springer. |
Gribomont, P. (1993). Concurrency without toil: a systematic method for parallel program design. Science of Computer Programming, 21 (1), 1-56. doi:10.1016/0167-6423(93)90007-C |
Gribomont, P., & Van Dongen, V. (1993). Generic systolic arrays: A methodology for systolic design. In TAPSOFT'93: Theory and Practice of Software Development. Springer. |
Gochet, P., & Gribomont, P. (1992). Logique : méthodes pour l'informatique fondamentale. Paris, France: Hemès. |
Gribomont, P. (1990). Stepwise refinement and concurrency: the finite-state case. Science of Computer Programming, 14 (2), 185-228. doi:10.1016/0167-6423(90)90020-E |
Gribomont, P. (1990). From synchronous to asynchronous communication. In Specification and Verification of Concurrent Systems (pp. 368-383). Springer. |
Gribomont, P. (1990). Development of concurrent systems by incremental transformation. In ESOP'90 (pp. 161-176). Springer. |
Gribomont, P. (1990). A programming logic for formal concurrent systems. In CONCUR'90 Theories of Concurrency: Unification and Extension (pp. 298-313). Springer. |
Gochet, P., & Gribomont, P. (1989). Logique des propositions, logique des prédicats. In A. Thayse & P. Gribomont, Approche logique de l'intelligence artificielle. Dunod. |
Gribomont, P. (1989). Stepwise refinement and concurrency: a small exercise. In Mathematics of Program Construction (pp. 219-238). Springer. |
Gribomont, P. (1989). Development of concurrent programs: an example. In TAPSOFT'89 (pp. 210-224). Springer. |
Gribomont, P., & Wolper, P. (1989). Temporal Logic. In From Modal Logic to Deductive Databases. John Wiley and Sons. |
Gochet, P., Grégoire Eric, Gribomont, P., Louis, G., Snyers, D., Thayse, A., & Wodon, P. (1988). From standard logic to logic programming: introducing a logic based approach to artificial intelligence. John Wiley & Sons. |
Gribomont, P. (1988). Proving systolic arrays. In CAAP'88 (pp. 185-199). Springer. |
Gribomont, P. (1987). Design and proof of communicating sequential processes. In PARLE Parallel Architectures and Languages Europe (pp. 261-276). Springer. |
Gribomont, P. (1985). Synthesis of parallel programs invariants. In Formal Methods and Software Development (pp. 325-338). Springer. |
Gribomont, P. (1985). Méthode progressive de synthèse et de vérification de programmes parallèles [Doctoral thesis, ULiège - Université de Liège]. ORBi-University of Liège. https://orbi.uliege.be/handle/2268/184474 |