Demo Data from SIGIR 2026 / reviewers in the wild / expert
Mark S. Boddy
dblp:93/5682
· DBLP profile ↗
16ranked-venue papers
5as first author
0since 2021 · last 2016
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 11 · 4 first-authorGraphics, computer vision, multimedia, augmented reality and games · 6 · 2 first-authorDatabases, data management, data science and information retrieval · 3Theory of computation · 2 · 1 first-authorSoftware engineering, systems software and programming languages · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
8 papers |
Planning, search and constraint satisfaction · 54% Probabilistic and Bayesian machine learning · 22% Generative modeling · 22% | |
| Human-computer interaction and pervasive computing
1 paper |
Ubiquitous computing and smart environments · 100% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Smart cities and intelligent transportation · 100% |
Topics — the 13 heaviest of 16, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Probabilistic and Bayesian machine learning › statistical inference
bayesian inference |
0.1 | 1 | 2011 | Bayesian Learning of Generalized Board Positions for Improved Move Prediction in Computer Go · AAAI 2011 |
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › game playing
computer go |
0.1 | 1 | 2011 | Bayesian Learning of Generalized Board Positions for Improved Move Prediction in Computer Go · AAAI 2011 |
Machine learning › Generative modeling › generative model
hierarchical generative model |
0.1 | 1 | 2011 | Bayesian Learning of Generalized Board Positions for Improved Move Prediction in Computer Go · AAAI 2011 |
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › game playing
move prediction |
0.1 | 1 | 2011 | Bayesian Learning of Generalized Board Positions for Improved Move Prediction in Computer Go · AAAI 2011 |
Smart cities and intelligent transportation › route planning
route recommendation |
0.1 | 1 | 2015 | Capturing Human Route Preferences From Track Information: New Results · AAAI 2015 |
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
planning under uncertainty |
0.0 | 1 | 1994 | Representing Uncertainty in Simple Planners · KR 1994 |
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › temporal planning
time-dependent planning |
0.0 | 2 | 1989 | Solving Time-Dependent Planning Problems · IJCAI 1989 An Analysis of Time-Dependent Planning · AAAI 1988 |
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
anytime algorithm |
0.0 | 1 | 1991 | Anytime Problem Solving Using Dynamic Programming · AAAI 1991 |
Algorithms and data structures
dynamic programming |
0.0 | 1 | 1991 | Anytime Problem Solving Using Dynamic Programming · AAAI 1991 |
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
temporal planning |
0.0 | 2 | 1988 | An Analysis of Time-Dependent Planning · AAAI 1988 Reasoning About Partially Ordered Events · Artif. Intell. 1988 |
Knowledge, reasoning and agents › Knowledge representation and reasoning
temporal reasoning |
0.0 | 1 | 1988 | Reasoning About Partially Ordered Events · Artif. Intell. 1988 |
Knowledge, reasoning and agents › Knowledge representation and reasoning
causal reasoning |
0.0 | 1 | 1987 | Incremental Causal Reasoning · AAAI 1987 |
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › temporal planning
time-constrained planning |
0.0 | 1 | 1994 | Deliberation Scheduling for Problem Solving in Time-Constrained Environments · Artif. Intell. 1994 |
Methods — techniques the papers use, named apart from their topics
trajectory analysis · 0.4hierarchical generative model · 0.1bayesian learning · 0.1dynamic programming · 0.0deliberation scheduling · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2016 | Frankencode: Creating Diverse Programs Using Code ClonesabstractIn this paper, we present an approach to detecting novel cyber attacks though a form of program diversification, similar to the use of n-version programming for fault tolerant systems. Building on extensive previous and ongoing work by others on the use of code clones in a wide variety of areas, our Functionally Equivalent Variants using Information Synchronization (FEVIS) system automatically generates program variants to berun in parallel, seeking to detect attacks through divergence in behavior. Unlike approaches to diversification that only change program memory layout and behavior, FEVIS can detect attacks exploiting vulnerabilities in execution timing, string processing, and other logic errors. We are in the early stages of research and development for this approach, but have made sufficient progress to provide a proof of concept and some lessons learned. In this paper we describe FEVIS and its application to diversifying an open-source webserver, with results on several different example classes of attack which FEVIS will detect. Hayley Borck, Mark S. Boddy, Ian J. De Silva, Steven A. Harp, Ken Hoyme, Steven Johnston, August Schwerdfeger, Mary Southern |
SANER | 2 |
| 2015 | Capturing Human Route Preferences From Track Information: New Results
Johnathan Gohde, Mark S. Boddy, Hazel Shackleton, Steve Johnston |
AAAI | 2 |
| 2014 | Reasoner Performance on Ontologies for Operations
Scott Bell, Jim Carciofini, Mark S. Boddy, R. Peter Bonasso |
KEOD | 3 |
| 2013 | PRONTOE - A Case Study for Developing Ontologies for OperationsabstractAbstract: In this paper, we describe a set of software tools called the PRIDE ONTOlogy Editor (PRONTOE) and a methodology that allows system operators and domain experts to build and maintain ontologies of their sys-tems with no explicit understanding of the underlying ontology representation. We present two case studies: one using NASA flight controllers, and another using the DARPA Robotic Challenge. 1 Scott Bell, R. Peter Bonasso, Mark S. Boddy, David Kortenkamp, Debra Schreckenghost |
KEOD | 3 |
| 2013 | PRONTOE: An Ontology Editor for Domain Experts
Scott Bell, R. Peter Bonasso, Mark S. Boddy, David Kortenkamp, Debra Schreckenghost |
IC3K | 3 |
| 2011 | Bayesian Learning of Generalized Board Positions for Improved Move Prediction in Computer GoabstractComputer Go presents a challenging problem for machine learning agents. With the number of possible board states estimated to be larger than the number of hydrogen atoms in the universe, learning effective policies or board evaluation functions is extremely difficult. In this paper we describe Cortigo, a system that efficiently and autonomously learns useful generalizations for large state-space classification problems such as Go. Cortigo uses a hierarchical generative model loosely related to the human visual cortex to recognize Go board positions well enough to suggest promising next moves. We begin by briefly describing and providing motivation for research in the computer Go domain. We describe Cortigo’s ability to learn predictive models based on large subsets of the Go board and demonstrate how using Cortigo’s learned models as additive knowledge in a state-of-the-art computer Go player (Fuego) significantly improves its playing strength. Martin Michalowski, Mark S. Boddy, Mike Neilsen |
AAAI | 2 |
| 2003 | Imperfect Match: PDDL 2.1 and Real ApplicationsabstractPDDL was originally conceived and constructed as a lingua franca for the International Planning Competition. PDDL2.1 embodies a set of extensions intended to support the expression of something closer to ``real planning problems.'' This objective has only been partially achieved, due in large part to a deliberate focus on not moving too far from classical planning models and solution methods. Mark S. Boddy |
J. Artif. Intell. Res. | 1 |
| 1994 | Representing Uncertainty in Simple Planners
Robert P. Goldman, Mark S. Boddy |
KR | 2 |
| 1994 | Epsilon-Safe Planning
Robert P. Goldman, Mark S. Boddy |
UAI | 2 |
| 1994 | Deliberation Scheduling for Problem Solving in Time-Constrained Environments
Mark S. Boddy, Thomas L. Dean |
Artif. Intell. | 1 |
| 1994 | A Critical Examination of Model Preference DefaultsabstractSelman and Kautz's paper on the logic of model-preference defaults introduced a new language and tractability results. This paper assesses the contributions of that work, including the properties of the logic itself, its relationship to some previous Mark S. Boddy, Robert P. Goldman, Keiji Kanazawa, Lynn Andrea Stein |
Fundam. Informaticae | 1 |
| 1991 | Anytime Problem Solving Using Dynamic Programming
Mark S. Boddy |
AAAI | 1 |
| 1989 | Solving Time-Dependent Planning Problems
Mark S. Boddy, Thomas L. Dean |
IJCAI | 1 |
| 1988 | An Analysis of Time-Dependent Planning
Thomas L. Dean, Mark S. Boddy |
AAAI | 2 |
| 1988 | Reasoning About Partially Ordered Events
Thomas L. Dean, Mark S. Boddy |
Artif. Intell. | 2 |
| 1987 | Incremental Causal Reasoning
Thomas L. Dean, Mark S. Boddy |
AAAI | 2 |