Topological logics are a family of languages for representing and reasoning about topological data. In this paper, we consider propositional topological logics able to express the...
Roman Kontchakov, Ian Pratt-Hartmann, Michael Zakh...
This paper addresses the problem of learning from highly structured data. Speci cally, it describes a procedure, called decomposition, that allows a learner to access automatically...
Dynamic communication systems (DCS) are complex because of their unboundedness in several dimensions. They have an unbounded and changing number of objects, a dynamically changing...
This paper presents three types of declarative goals: perform goals, achieve goals, and maintain goals. The integration of these goal types in a simple but extendable logic-based a...
Mehdi Dastani, M. Birna van Riemsdijk, John-Jules ...
Reversible finite automata with halting states (RFA) were first considered by Ambainis and Freivalds to facilitate the research of KondacsWatrous quantum finite automata. In this ...