Priority Arguments is a proof technique in computability theory that resolves conflicts between countably many requirements by assigning priorities to them and iteratively satisfying higher-priority requirements while minimizing damage to previously satisfied lower-priority ones.
35
Publications
1.9K
Citations
53
Authors
43
Institutions
Publications per year
2017–2026
7
Parents
Publications
35
1–5 of 35
Authors
53
- CS
2
h-index
- CC
2
h-index
- PM
2
h-index
- MB
1
h-index
- RP
1
h-index
1–5 of 53
Institutions
43
Ruhr University Bochum
Bochum, Germany
2 h-index
4 publications
48 citations
Asian Institute of Technology
Pathum Thani, Thailand
2 h-index
2 publications
63 citations
University of Wisconsin–Madison
Madison, United States
1 h-index
1 publications
10 citations
Karlsruhe Institute of Technology
Karlsruhe, Germany
1 h-index
1 publications
35 citations
Old Dominion University
Norfolk, United States
1 h-index
1 publications
21 citations
University of Stirling
Stirling, United Kingdom
1 h-index
1 publications
29 citations
Cornell University
Ithaca, United States
1 h-index
1 publications
13 citations
University of Southern California
Los Angeles, United States
1 h-index
3 publications
96 citations
1–8 of 43
Venues
- Artificial Intelligence
2 publications · 63 citations
2
h-index
- Philosophical Studies
2 publications · 38 citations
2
h-index
- Theoretical Computer Science
2 publications · 48 citations
2
h-index
- Adaptive Agents and Multi-Agents Systems
Conference · 1 publications · 12 citations
1
h-index
- Noûs
1 publications · 47 citations
1
h-index
1–5