default search action
Frank D. Valencia
Frank Valencia
Person information
- affiliation: École Polytechnique, Paris, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j22]Carlos Pinzón
, Catuscia Palamidessi, Pablo Piantanida, Frank Valencia:
On the incompatibility of accuracy and equal opportunity. Mach. Learn. 113(5): 2405-2434 (2024) - [c52]Jesús Aranda, Sebastián Betancourt, Juan Francisco Díaz
Fairness and Consensus in an Asynchronous Opinion Model for Social Networks. CONCUR 2024: 7:1-7:17 - [c51]Mário S. Alvim, Artur Gaspar da Silva, Sophia Knight
A Multi-agent Model for Opinion Evolution in Social Networks Under Cognitive Biases. FORTE 2024: 3-19 - [c50]Carlos Olarte, Carlos Ramírez, Camilo Rocha, Frank Valencia:
Unified Opinion Dynamic Modeling as Concurrent Set Relations in Rewriting Logic. WRLA 2024: 104-123 - [i13]Carlos Olarte, Carlos Ramírez, Camilo Rocha, Frank Valencia:
Unified Opinion Dynamic Modeling as Concurrent Set Relations in Rewriting Logic. CoRR abs/2402.09021 (2024) - [i12]Mário S. Alvim, Artur Gaspar da Silva, Sophia Knight, Frank Valencia:
A Multi-Agent Model for Opinion Evolution under Cognitive Biases. CoRR abs/2402.17615 (2024) - [i11]Juan Paz, Camilo Rocha, Luis E. Tobón, Frank Valencia:
Consensus in Models for Opinion Dynamics with Generalized-Bias. CoRR abs/2409.10809 (2024) - 2023
- [j21]Mário S. Alvim, Bernardo Amorim, Sophia Knight, Santiago Quintero, Frank Valencia:
A Formal Model for Polarization under Confirmation Bias in Social Networks. Log. Methods Comput. Sci. 19(1) (2023) - [i10]Joan S. Betancourt, Jesús Aranda
Fairness and Consensus in a Gossip Model of Social Networks. CoRR abs/2312.12251 (2023) - 2022
- [c49]Carlos Pinzón, Catuscia Palamidessi, Pablo Piantanida, Frank Valencia:
On the Impossibility of Non-trivial Accuracy in Presence of Fairness Constraints. AAAI 2022: 7993-8000 - [i9]Santiago Quintero, Carlos Pinzón, Sergio Ramírez, Frank Valencia:
On the Computation of Distributed Knowledge as the Greatest Lower Bound of Knowledge. CoRR abs/2210.08128 (2022) - [i8]Carlos Pinzón, Santiago Quintero, Sergio Ramírez, Camilo Rueda, Frank Valencia:
Counting and Computing Join-Endomorphisms in Lattices (Revisited). CoRR abs/2211.00781 (2022) - 2021
- [j20]Michell Guzmán, Sophia Knight
Reasoning about distributed information with infinitely many agents. J. Log. Algebraic Methods Program. 121: 100674 (2021) - [c48]Carlos Pinzón, Santiago Quintero
Computing Distributed Knowledge as the Greatest Lower Bound of Knowledge. RAMiCS 2021: 413-432 - [c47]Mário S. Alvim
A Multi-agent Model for Polarization Under Confirmation Bias in Social Networks. FORTE 2021: 22-41 - [i7]Mário S. Alvim, Bernardo Amorim, Sophia Knight, Santiago Quintero, Frank Valencia:
A Multi-Agent Model for Polarization under Confirmation Bias in Social Networks. CoRR abs/2104.11538 (2021) - [i6]Carlos Pinzón, Catuscia Palamidessi, Pablo Piantanida, Frank Valencia:
On the impossibility of non-trivial accuracy under fairness constraints. CoRR abs/2107.06944 (2021) - [i5]Mário S. Alvim, Bernardo Amorim, Sophia Knight
A Formal Model for Polarization under Confirmation Bias in Social Networks. CoRR abs/2112.09542 (2021) - 2020
- [j19]Mário S. Alvim, Konstantinos Chatzikokolakis, Carlos Olarte, Frank D. Valencia:
Catuscia Palamidessi: a journey from logic and concurrency to security and privacy. ACM SIGLOG News 7(1): 47-50 (2020) - [c46]Santiago Quintero
Counting and Computing Join-Endomorphisms in Lattices. RAMiCS 2020: 253-269 - [i4]Michell Guzmán, Sophia Knight
Algebraic Structures from Concurrent Constraint Programming Calculi for Distributed Information in Multi-Agent Systems. CoRR abs/2010.10667 (2020) - [i3]Mário S. Alvim, Bernardo Amorim, Sophia Knight, Santiago Quintero, Frank Valencia:
Polarization and Belief Convergence of Agents in Strongly-Connected Influence Graphs. CoRR abs/2012.02703 (2020)
2010 – 2019
- 2019
- [j18]Martin Leucker
Preface to special issue: ICTAC 2015. Math. Struct. Comput. Sci. 29(1): 1-2 (2019) - [c45]Mário S. Alvim
Toward a Formal Model for Group Polarization in Social Networks. The Art of Modelling Computational Systems 2019: 419-441 - [c44]Nicolás Aristizabal, Carlos Pinzón, Camilo Rueda, Frank Valencia:
Make Puzzles Great Again. The Art of Modelling Computational Systems 2019: 442-459 - [c43]Michell Guzmán, Sophia Knight
Reasoning About Distributed Knowledge of Groups with Infinitely Many Agents. CONCUR 2019: 29:1-29:15 - [c42]Frank Valencia:
Semantic Structures for Spatially-Distributed Multi-Agent Systems. EXPRESS/SOS 2019: 39-53 - [e6]Mário S. Alvim, Kostas Chatzikokolakis, Carlos Olarte
The Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy - Essays Dedicated to Catuscia Palamidessi on the Occasion of Her 60th Birthday. Lecture Notes in Computer Science 11760, Springer 2019, ISBN 978-3-030-31174-2 [contents] - [i2]Miguel Romero, Sergio Ramírez, Camilo Rocha, Frank Valencia:
A Rewriting Logic Approach to Stochastic and Spatial Constraint System Specification and Verification. CoRR abs/1909.03819 (2019) - 2018
- [j17]Michell Guzmán, Salim Perchy, Camilo Rueda
Characterizing right inverses for spatial constraint systems with applications to modal logic. Theor. Comput. Sci. 744: 56-77 (2018) - [c41]Sergio Ramírez, Miguel Romero, Camilo Rocha
Real-Time Rewriting Logic Semantics for Spatial Concurrent Constraint Programming. WRLA@ETAPS 2018: 226-244 - 2017
- [j16]Stefan Haar, Salim Perchy, Frank Valencia:
Declarative Framework for Semantical Interpretations of Structured Information - An Applicative Approach. Int. J. Semantic Comput. 11(4): 451-472 (2017) - [j15]Michell Guzmán, Stefan Haar, Salim Perchy, Camilo Rueda
Belief, knowledge, lies and other utterances in an algebra for space and extrusion. J. Log. Algebraic Methods Program. 86(1): 107-133 (2017) - [j14]Fabio Gadducci
Observational and behavioural equivalences for soft concurrent constraint programming. J. Log. Algebraic Methods Program. 92: 45-63 (2017) - [c40]Stefan Haar, Salim Perchy, Frank D. Valencia:
D-SPACES: Implementing Declarative Semantics for Spatially Structured Information. ICSC 2017: 227-233 - 2016
- [j13]Sibylle B. Fröschle, Frank D. Valencia:
Preface to special issue: EXPRESS 2010. Math. Struct. Comput. Sci. 26(6): 907 (2016) - [j12]Bas Luttik, Frank D. Valencia:
Preface to special issue: EXPRESS 2011. Math. Struct. Comput. Sci. 26(8): 1351 (2016) - [c39]Michell Guzmán, Frank D. Valencia:
On the Expressiveness of Spatial Constraint Systems. ICLP (Technical Communications) 2016: 16:1-16:12 - [c38]Michell Guzmán, Salim Perchy, Camilo Rueda
Deriving Inverse Operators for Modal Logic. ICTAC 2016: 214-232 - 2015
- [j11]Luis Fernando Pino, Andrés A. Aristizábal P., Filippo Bonchi
Weak CCP bisimilarity with strong procedures. Sci. Comput. Program. 100: 84-104 (2015) - [j10]Luis Fernando Pino, Filippo Bonchi
Efficient algorithms for program equivalence for confluent concurrent constraint programming. Sci. Comput. Program. 111: 135-155 (2015) - [c37]Fabio Gadducci
A Labelled Semantics for Soft Concurrent Constraint Programming. COORDINATION 2015: 133-149 - [c36]Salim Perchy, Frank Valencia:
Opinions and Beliefs as constraint system operators. ICLP (Technical Communications) 2015 - [c35]Stefan Haar, Salim Perchy, Camilo Rueda
An algebraic view of space/belief and extrusion/utterance for concurrency/epistemic logic. PPDP 2015: 161-172 - [e5]Martin Leucker, Camilo Rueda
Theoretical Aspects of Computing - ICTAC 2015 - 12th International Colloquium Cali, Colombia, October 29-31, 2015, Proceedings. Lecture Notes in Computer Science 9399, Springer 2015, ISBN 978-3-319-25149-3 [contents] - 2014
- [c34]Luis Fernando Pino, Filippo Bonchi
A Behavioral Congruence for Concurrent Constraint Programming with Nondeterministic Choice. ICTAC 2014: 351-368 - 2013
- [j9]Carlos Olarte
Models and emerging trends of concurrent constraint programming. Constraints An Int. J. 18(4): 535-578 (2013) - [c33]Luis Fernando Pino, Filippo Bonchi
Efficient computation of program equivalence for confluent concurrent constraint programming. PPDP 2013: 263-274 - 2012
- [c32]Sophia Knight
Spatial and Epistemic Modalities in Constraint-Based Process Calculi. CONCUR 2012: 317-332 - [c31]Andrés Aristizábal, Filippo Bonchi
Partition refinement for bisimilarity in CCP. SAC 2012: 88-93 - [c30]Andrés Aristizábal, Filippo Bonchi
Reducing Weak to Strong Bisimilarity in CCP. ICE 2012: 2-16 - [c29]Marco Giunti
Hide and New in the Pi-Calculus. EXPRESS/SOS 2012: 65-79 - [i1]Andrés Aristizábal, Filippo Bonchi, Luis Fernando Pino, Frank D. Valencia:
Partition Refinement for Bisimilarity in CCP. CoRR abs/1212.1548 (2012) - 2011
- [c28]Andrés Aristizábal, Filippo Bonchi
Deriving Labels and Bisimilarity for Concurrent Constraint Programming. FoSSaCS 2011: 138-152 - [c27]Diana Hermith
Modeling Cellular Signaling Systems: An Abstraction-Refinement Approach. PACBB 2011: 321-328 - [e4]Bas Luttik, Frank Valencia:
Proceedings 18th International Workshop on Expressiveness in Concurrency, EXPRESS 2011, Aachen, Germany, 5th September 2011. EPTCS 64, 2011 [contents] - 2010
- [p1]Maurizio Gabbrielli
Concurrent and Reactive Constraint Programming. 25 Years GULP 2010: 231-253 - [e3]Sibylle B. Fröschle, Frank D. Valencia:
Proceedings 17th International Workshop on Expressiveness in Concurrency, EXPRESS'10, Paris, France, August 30th, 2010. EPTCS 41, 2010 [contents]
2000 – 2009
- 2009
- [j8]Marco Carbone, Pawel Sobocinski
Foreword: Festschrift for Mogens Nielsen's 60th birthday. Theor. Comput. Sci. 410(41): 4001-4005 (2009) - [c26]Jesús Aranda
On the Expressive Power of Restriction and Priorities in CCS with Replication. FoSSaCS 2009: 242-256 - [c25]Jesús Aranda
An Overview of FORCES: An INRIA Project on Declarative Formalisms for Emergent Systems. ICLP 2009: 509-513 - [e2]Mogens Nielsen, Antonín Kucera, Peter Bro Miltersen, Catuscia Palamidessi, Petr Tuma, Frank D. Valencia:
SOFSEM 2009: Theory and Practice of Computer Science, 35th Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv Mlýn, Czech Republic, January 24-30, 2009. Proceedings. Lecture Notes in Computer Science 5404, Springer 2009, ISBN 978-3-540-95890-1 [contents] - 2008
- [c24]Romain Beauxis, Catuscia Palamidessi
On the Asynchronous Nature of the Asynchronous pi-Calculus. Concurrency, Graphs and Models 2008: 473-492 - [c23]Jesús Aranda
Stochastic Behavior and Explicit Discrete Time in Concurrent Constraint Programming. ICLP 2008: 682-686 - [c22]Carlos Olarte
The expressivity of universal timed CCP: undecidability of Monadic FLTL and closure operators for security. PPDP 2008: 8-19 - [c21]Carlos Olarte
Universal concurrent constraint programing: symbolic semantics and applications to security. SAC 2008: 145-150 - [e1]Catuscia Palamidessi, Frank Valencia:
Proceedings of the LIX Colloquium on Emerging Trends in Concurrency Theory, LIX 2006, Paris, France, November 13-15, 2006. Electronic Notes in Theoretical Computer Science 209, Elsevier 2008 [contents] - 2007
- [c20]Jesús Aranda
CCS with Replication in the Chomsky Hierarchy: The Expressive Power of Divergence. APLAS 2007: 383-398 - [c19]Moreno Falaschi
Declarative Diagnosis of Temporal Concurrent Constraint Programs. ICLP 2007: 271-285 - [c18]Carlos Olarte
Universal Timed Concurrent Constraint Programming. ICLP 2007: 464-465 - [c17]Diletta Cacciagrano
Linearity, Persistence and Testing Semantics in the Asynchronous Pi-Calculus. EXPRESS 2007: 59-84 - 2006
- [j7]Catuscia Palamidessi, Frank D. Valencia:
Languages for Concurrency. Bull. EATCS 90: 155-171 (2006) - [c16]Jesús Aranda
On Recursion, Replication and Scope Mechanisms in Process Calculi. FMCO 2006: 185-206 - [c15]Hugo A. López
A Declarative Framework for Security: Secure Concurrent Constraint Programming. ICLP 2006: 449-450 - [c14]Catuscia Palamidessi
On the Expressiveness of Linearity vs Persistence in the Asychronous Pi-Calculus. LICS 2006: 59-68 - [c13]Catuscia Palamidessi
Preface. LIX 2006: 1-4 - [c12]Julian Gutierrez, Jorge A. Pérez
Timed Concurrent Constraint Programming for Analysing Biological Systems. MeCBIC@ICALP 2006: 117-137 - 2005
- [j6]Catuscia Palamidessi, Frank D. Valencia:
Recursion vs Replication in Process Calculi: Expressiveness. Bull. EATCS 87: 105-125 (2005) - [j5]Frank D. Valencia:
Decidability of infinite-state timed CCP processes and first-order LTL. Theor. Comput. Sci. 330(3): 577-607 (2005) - [c11]Stefan S. Dantchev, Frank D. Valencia:
On the computational limits of infinite satisfaction. SAC 2005: 393-397 - 2004
- [j4]Camilo Rueda
On validity in modelization of musical problems by CCP. Soft Comput. 8(9): 641-648 (2004) - [c10]Pablo Giambiagi, Gerardo Schneider, Frank D. Valencia:
On the Expressiveness of Infinite Behavior and Name Scoping in Process Calculi. FoSSaCS 2004: 226-240 - [c9]Camilo Rueda, Frank D. Valencia:
Non-viability Deductions in Arc-Consistency Computation. ICLP 2004: 343-355 - 2003
- [c8]Mogens Nielsen, Frank D. Valencia:
Notes on Timed Concurrent Constraint Programming. Lectures on Concurrency and Petri Nets 2003: 702-741 - [c7]Frank D. Valencia:
Concurrency, Time, and Constraints. ICLP 2003: 72-101 - [c6]Frank D. Valencia:
Timed Concurrent Constraint Programming: Decidability Results and Their Application to LTL. ICLP 2003: 422-437 - 2002
- [j3]Mogens Nielsen, Catuscia Palamidessi, Frank D. Valencia:
Temporal Concurrent Constraint Programming: Denotation, Logic and Applications. Nord. J. Comput. 9(1): 145-188 (2002) - [c5]Mogens Nielsen, Frank D. Valencia:
Temporal Concurrent Constraint Programming: Applications and Behavior. Formal and Natural Computing 2002: 298-324 - [c4]Camilo Rueda, Frank Valencia:
Proving Musical Properties using a temporal Concurrent Constraint Calculus. ICMC 2002 - [c3]Mogens Nielsen, Catuscia Palamidessi
On the expressive power of temporal concurrent constraint programming languages. PPDP 2002: 156-167 - 2001
- [j2]Camilo Rueda
Integrating Constraints and Concurrent Objects in Musical Applications: A Calculus and its Visual Language. Constraints An Int. J. 6(1): 21-52 (2001) - [c2]Catuscia Palamidessi
A Temporal Concurrent Constraint Programming Calculus. CP 2001: 302-316 - [c1]Frank D. Valencia:
Temporal Concurrent Constraint Programming. CP 2001: 786
1990 – 1999
- 1998
- [j1]Juan Francisco Díaz, Camilo Rueda, Frank D. Valencia:
Pi+- Calculus: A Calculus for Concurrent Processes with Constraints. CLEI Electron. J. 1(2) (1998)
Coauthor Index
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 2024-10-15 21:37 CEST 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: