Universidade de ´Evora’s Integrated Information System (SIIUE) aims at representing the entire universe of concepts useful for the management and day-to-day operation of the Or...
In Floyd-Hoare logic, programs are dynamic while assertions are static (hold at states). In action logic the two notions become one, with programs viewed as on-the-fly assertions ...
This paper introduces a newalgorithm called SIAO1 for learning first order logic rules withgenetic algorithms. SIAO1uses the covering principle developed in AQwhereseed examplesar...
We propose and study extensions of logic programming with constraints represented as generalized atoms of the form C(X), where X is a finite set of atoms and C is act constraint (...
Dynamic topological logics are combinations of topological and temporal modal logics that are used for reasoning about dynamical systems consisting of a topological space and a con...
Boris Konev, Roman Kontchakov, Frank Wolter, Micha...