TOP
Search the Dagstuhl Website
Looking for information on the websites of the individual seminars? - Then please:
Not found what you are looking for? - Some of our services have separate websites, each with its own search option. Please check the following list:
Schloss Dagstuhl - LZI - Logo
Schloss Dagstuhl Services
Seminars
Within this website:
External resources:
  • DOOR (for registering your stay at Dagstuhl)
  • DOSA (for proposing future Dagstuhl Seminars or Dagstuhl Perspectives Workshops)
Publishing
Within this website:
External resources:
dblp
Within this website:
External resources:
  • the dblp Computer Science Bibliography


Dagstuhl Seminar 27361

Next-Generation Methods for Model Construction in Automated Reasoning

( Sep 05 – Sep 10, 2027 )

Permalink
Please use the following short url to reference this page: https://www.dagstuhl.de/27361

Organizers
  • João Jorge Araújo (NOVA University of Lisbon, PT)
  • Mikoláš Janota (Czech Technical University - Prague, CZ)
  • J.D. Phillips (Northern Michigan University - Marquette, US)
  • Michael Rawson (University of Southampton, GB)

Contact

Motivation

This Dagstuhl Seminar aims to find new ways to represent and construct models of logical formulas, particularly large or infinite models. Models play a central role in formal reasoning. In mathematics, a model represents an object with certain properties, sometimes realizing a counterexample to a conjecture. In software verification, models typically represent an execution that reveals a bug in a program: finite (e.g. crash) or infinite (e.g. livelock). Program synthesis as a field is naturally close to model building. Models are inherently difficult to find: determining whether a sentence of first-order logic is satisfiable is undecidable, for example.

Current approaches, such as encoding model construction as Boolean satisfiability, rely on explicit representations that become rapidly intractable as the model size and state space grow. However, new opportunities are emerging from advances in mathematics, symbolic reasoning, satisfiability modulo theories (SMT), and program synthesis, which may enable the discovery of larger and more complex models.

Attendees will include researchers from automated reasoning, formal methods, and mathematics. By fostering collaboration between these communities, the seminar seeks to advance both the theoretical foundations and the practical capabilities of automated model finding. After orientation and illustrative talks covering the state of the art, knowledge exchange and problem-solving sessions begin in smaller groups. The main goal will be new methods for finding and representing large or infinite models, motivated by problems and techniques from abstract algebra. Secondary goals might include the requirements for trustworthy, checkable models; the design of certificates and languages for model representation; and the potential for cross-disciplinary tools that unify model generation, reasoning, and reuse.

If you are a mathematician: your insights into structure will be invaluable. Your favorite examples (and constructions) of finite and infinite objects and counterexamples will provide inspiration for the next generation of automated model builders. These may prove useful in your future mathematical work!

If you are a computer scientist: your intuition for programs and bugs will serve you well. Your main role here is to help invent and apply new or radically improved high-performance model-building routines, backed by new theory and inspired by techniques from other communities. Such routines will no doubt have many valuable applications in the seminar’s orbit and beyond.

Copyright João Jorge Araújo, Mikoláš Janota, J.D. Phillips, and Michael Rawson

Classification
  • Artificial Intelligence
  • Logic in Computer Science
  • Mathematical Software

Keywords
  • models
  • automated-reasoning
  • SMT
  • algebra
  • logic