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 (...
In this paper, we propose a proof system for reasoning on certain specifications of secure authentication systems. For this purpose, a new logic, sequence-indexed linear-time temp...
Probabilistic logics have attracted a great deal of attention during the past few years. While logical languages have taken a central position in research on knowledge representati...
Arjen Hommersom, Nivea de Carvalho Ferreira, Peter...
Abstract. Markov logic, as a highly expressive representation formalism that essentially combines the semantics of probabilistic graphical models with the full power of first-orde...
Dominik Jain, Bernhard Kirchlechner, Michael Beetz
In recent work Baader has shown that a certain description logic with conjunction, existential quantification and with circular definitions has a polynomial time subsumption pro...