We introduce a generalization of Independence Friendly (IF) logic in which Eloise (the player) is restricted to a finite amount of information about Abelard's ('s) move...
We introduce a methodology and framework for expressing general preference information in logic programming under the answer set semantics. An ordered logic program is an extended...
A survey of effective characterizations of tree logics. If L is a logic, then an effective characterization for L is an algorithm, which inputs a tree automaton and replies if the...
We present an axiomatisation for an extension of a temporal epistemic logic with an epistemic “reset” operator defined on the intersection between epistemic and temporal rela...
We propose a timing-oriented logic optimization technique called Generalized De Morgan (GDM) transform, that integrates gate resizing, net buffering and De Morgan transformation. ...