James T. Oswald
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
James T. Oswald has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
- Thomas Macaulay Ferguson
Rensselaer Polytechnic Institute
5 shared publications - Brandon Rozek
Rensselaer Polytechnic Institute
3 shared publications - Selmer Bringsjord
Rensselaer Polytechnic Institute
3 shared publications - Kyle J. Fuller
Rensselaer Polytechnic Institute
2 shared publications - Aidan Flaherty
Rensselaer Polytechnic Institute (RPI)
1 shared publication - Deacon R. Sawyer
Rensselaer Polytechnic Institute
1 shared publication
Latest Publications
- 23 July 2026
- Published by Springer Nature
- p. 374-390
A Legg-Hutter Intelligence Measure for Continuous-Time Analog Agents and Environments
- 23 July 2026
- Published by Springer Nature
- p. 374-390
A Legg-Hutter Intelligence Measure for Continuous-Time Analog Agents and Environments
- 7 August 2025
- Published by Springer Nature
- p. 23-33
On the Arrowian Impossibility of Machine Intelligence Measures
- 7 August 2025
- Published by Springer Nature
- p. 23-33
On the Arrowian Impossibility of Machine Intelligence Measures
- Open Access
- 11 April 2025
- Published by Association for the Advancement of Artificial Intelligence (AAAI) in Proceedings of the AAAI Conference on Artificial Intelligence
- Vol. 39 (28) , 29456-29458
A Modal Logic of Optimality (Student Abstract)
We present our work on a new modal logic of optimality, OPT, whose semantics are modeled in terms of optimal paths through reward-weighted transition systems. We prove some basic properties of OPT, including its status as a normal modal logic, as well as its relation to some of the standard modal axioms. We end with a discussion of applications to AI and future research directions and extensions.
- 11 April 2025
- Published by Association for the Advancement of Artificial Intelligence (AAAI) in Proceedings of the AAAI Conference on Artificial Intelligence
- Vol. 39 (28) , 29456-29458
Open AccessA Modal Logic of Optimality (Student Abstract)
We present our work on a new modal logic of optimality, OPT, whose semantics are modeled in terms of optimal paths through reward-weighted transition systems. We prove some basic properties of OPT, including its status as a normal modal logic, as well as its relation to some of the standard modal axioms. We end with a discussion of applications to AI and future research directions and extensions.
- 17 July 2024
- Published by Springer Nature
- p. 134-144
A Universal Intelligence Measure for Arithmetical Uncomputable Environments
- 17 July 2024
- Published by Springer Nature
- p. 134-144
A Universal Intelligence Measure for Arithmetical Uncomputable Environments
- 24 May 2024
- Published by Springer Nature in KI - Künstliche Intelligenz
- Vol. 38 (1-2) , 45-59
Modeling $\mathscr {C}^{0}$ Family Logics for Artificial Intelligence: Doxastic-Temporal Logics for Reasoning About Goals- 24 May 2024
- Published by Springer Nature in KI - Künstliche Intelligenz
- Vol. 38 (1-2) , 45-59
Modeling $\mathscr {C}^{0}$ Family Logics for Artificial Intelligence: Doxastic-Temporal Logics for Reasoning About Goals- Open Access
- 24 March 2024
- Published by Association for the Advancement of Artificial Intelligence (AAAI) in Proceedings of the AAAI Conference on Artificial Intelligence
- Vol. 38 (21) , 23604-23605
Large Language Models as Planning Domain Generators (Student Abstract)
The creation of planning models, and in particular domain models, is among the last bastions of tasks that require exten- sive manual labor in AI planning; it is desirable to simplify this process for the sake of making planning more accessi- ble. To this end, we investigate whether large language mod- els (LLMs) can be used to generate planning domain models from textual descriptions. We propose a novel task for this as well as a means of automated evaluation for generated do- mains by comparing the sets of plans for domain instances. Finally, we perform an empirical analysis of 7 large language models, including coding and chat models across 9 different planning domains. Our results show that LLMs, particularly larger ones, exhibit some level of proficiency in generating correct planning domains from natural language descriptions
- 24 March 2024
- Published by Association for the Advancement of Artificial Intelligence (AAAI) in Proceedings of the AAAI Conference on Artificial Intelligence
- Vol. 38 (21) , 23604-23605
Open AccessLarge Language Models as Planning Domain Generators (Student Abstract)
The creation of planning models, and in particular domain models, is among the last bastions of tasks that require exten- sive manual labor in AI planning; it is desirable to simplify this process for the sake of making planning more accessi- ble. To this end, we investigate whether large language mod- els (LLMs) can be used to generate planning domain models from textual descriptions. We propose a novel task for this as well as a means of automated evaluation for generated do- mains by comparing the sets of plans for domain instances. Finally, we perform an empirical analysis of 7 large language models, including coding and chat models across 9 different planning domains. Our results show that LLMs, particularly larger ones, exhibit some level of proficiency in generating correct planning domains from natural language descriptions
- Open Access
- 17 November 2023
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 396, 36-51
Parallel Verification of Natural Deduction Proof Graphs
Graph-based interactive theorem provers offer a visual representation of proofs, explicitly representing the dependencies and inferences between each of the proof steps in a graph or hypergraph format. The number and complexity of these dependency links can determine how long it takes to verify the validity of the entire proof. Towards this end, we present a set of parallel algorithms for the formal verification of graph-based natural deduction (N D) style proofs. We introduce a definition of layering that captures dependencies between the proof steps (nodes). Nodes in each layer can then be verified in parallel as long as prior layers have been verified. To evaluate the performance of our algorithms on proof graphs, we propose a framework for finding the performance bounds and patterns using directed acyclic network topologies (DANTs). This framework allows us to create concrete instances of DANTs for empirical evaluation of our algorithms. With this, we compare our set of parallel algorithms against a serial implementation with two experiments: one scaling the problem size and the other scaling the number of threads. Our findings show that parallelization results in improved verification performance for certain DANT instances. We also show that our algorithms scale for certain DANT instances with respect to the number of threads.
- 17 November 2023
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 396, 36-51
Open AccessParallel Verification of Natural Deduction Proof Graphs
Graph-based interactive theorem provers offer a visual representation of proofs, explicitly representing the dependencies and inferences between each of the proof steps in a graph or hypergraph format. The number and complexity of these dependency links can determine how long it takes to verify the validity of the entire proof. Towards this end, we present a set of parallel algorithms for the formal verification of graph-based natural deduction (N D) style proofs. We introduce a definition of layering that captures dependencies between the proof steps (nodes). Nodes in each layer can then be verified in parallel as long as prior layers have been verified. To evaluate the performance of our algorithms on proof graphs, we propose a framework for finding the performance bounds and patterns using directed acyclic network topologies (DANTs). This framework allows us to create concrete instances of DANTs for empirical evaluation of our algorithms. With this, we compare our set of parallel algorithms against a serial implementation with two experiments: one scaling the problem size and the other scaling the number of threads. Our findings show that parallelization results in improved verification performance for certain DANT instances. We also show that our algorithms scale for certain DANT instances with respect to the number of threads.
- 14 January 2023
- Published by Springer Nature
- p. 178-187
PERI.2 Goes to PreSchool and Beyond, in Search of AGI
- 14 January 2023
- Published by Springer Nature
- p. 178-187
PERI.2 Goes to PreSchool and Beyond, in Search of AGI