Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
William Boisseleau
Claudia Calabrese
Hao Mao
Peter Malec
Giovanni Venturelli
Chen Ma
Maxime Peralta
Qinyi Zhao
Radu Timofte
Kuanrui Yin
Home
/
Author
/
LIRON COHEN
Author Info
Open Visualization
Name
Affiliation
Papers
LIRON COHEN
University of Southern California, Los Angeles, CA, USA
29
Collaborators
Citations
PageRank
32
36
11.24
Referers
Referees
References
48
154
121
Search Limit
100
154
Publications (29 rows)
Collaborators (32 rows)
Referers (48 rows)
Referees (100 rows)
Title
Citations
PageRank
Year
Evidenced Frames: A Unifying Framework Broadening Realizability Models
0
0.34
2021
Non-Well-Founded Deduction For Induction And Coinduction
0
0.34
2021
Open Bar - a Brouwerian Intuitionistic Logic with a Pinch of Excluded Middle.
0
0.34
2021
Integrating Induction and Coinduction via Closure Operators and Proof Cycles.
0
0.34
2020
Non-well-founded Proof Theory of Transitive Closure Logic
0
0.34
2020
Embedding Directed Graphs in Potential Fields Using FastMap-D.
0
0.34
2020
Towards automated reasoning in Herbrand structures.
0
0.34
2019
The Effects of Effects on Constructivism.
0
0.34
2019
The middle ground-ancestral logic
2
0.44
2019
Bar Induction is Compatible with Constructive Type Theory.
0
0.34
2019
Intuitionistic ancestral logic.
0
0.34
2019
Infinitary and Cyclic Proof Systems for Transitive Closure Logic.
0
0.34
2018
Rapid Randomized Restarts for Multi-Agent Path Finding Solvers.
0
0.34
2018
Uniform Inductive Reasoning in Transitive Closure Logic via Infinite Descent.
0
0.34
2018
A Verified Theorem Prover Backend Supported by a Monotonic Library.
0
0.34
2018
Adding Heuristics to Conflict-Based Search for Multi-Agent Path Finding.
1
0.35
2018
A Minimal Computational Theory of a Minimal Computational Universe.
0
0.34
2018
Applicable Mathematics in a Minimal Computational Theory of Sets.
0
0.34
2018
Computability Beyond Church-Turing via Choice Sequences.
0
0.34
2018
Overview: Generalizations of Multi-Agent Path Finding to Real-World Scenarios.
6
0.45
2017
Completeness for Ancestral Logic via a Computationally-Meaningful Semantics.
1
0.37
2017
Reasoning Inside The Box: Deduction in Herbrand Logics.
0
0.34
2017
Feasibility Study: Moving Non-Homogeneous Teams in Congested Video Game Environments.
2
0.37
2017
Multi-Agent Path Finding with Kinematic Constraints.
5
0.42
2016
Formalizing Scientifically Applicable Mathematics in a Definitional Framework.
2
0.47
2016
Feasibility Study: Using Highways for Bounded-Suboptimal Multi-Agent Path Finding
13
1.05
2015
Intuitionistic Ancestral Logic as a Dependently Typed Abstract Programming Language
0
0.34
2015
Characterizing online cost-sharing mechanisms fordemand responsive transport systems
1
0.40
2014
Ancestral Logic: A Proof Theoretical Study.
3
0.48
2014
1
