An axiomatic theory represents mathematical knowledge declaratively as a set of axioms. An algorithmic theory represents mathematical knowledge procedurally as a set of algorithms....
A class of interval-based temporal languages for uniformly representing and reasoning about actions and plans is presented. Actions are represented by describing what is true whil...
Abstract. Efficiency of the first-order logic proof procedure is a major issue when deduction systems are to be used in real environments, both on their own and as a component of ...
Stefano Ferilli, Nicola Di Mauro, Teresa Maria Alt...
We describe asasp, a symbolic reachability procedure for the analysis of administrative access control policies. The tool represents access policies and their administrative action...
Francesco Alberti, Alessandro Armando, Silvio Rani...
We present a general logic of explicit knowledge represented as finite sets of logical formulae which can evolve by nondeterministic reasoning and communication. It is partly bas...