Most of the theories on formalising intention interpret it as a unary modal operator in Kripkean semantics, which gives it a monotonic look. We argue that policy-based intentions [8] exhibit non-monotonic behaviour which could be captured through a non-monotonic system like defeasible logic. To this end we outline a defeasible logic of intention. The proposed technique alleviates most of the pr...

Parametrized logic programs are very expressive logic programs that generalize normal logic programs under the stable model semantics, by allowing complex formulas of a parameter logic to appear in the body and head of rules. In this paper we explore the use of description logics as parameter logics, and show the expressivity of this framework for combining rules and ontologies. Introduction Pa...

Artificial Intelligence needs a formal theory of the process of non-monotonic reasoning. Ideally, such a theory would decide, for every proposition and state of the process, whether the program should believe the proposition in that state, or remain agnostic. Without non-monotonic inference rules, non-monotonic inferences cannot be explained in the same relational, rule-based fashion as other i...

In natural )a~gnage, as in other computational task domains it is impox~ant tc~ operate by default assumptions. First, m~my constraints re(tni~'exl h)r constraint propagation are initially tmspecified, Second, in highly ambiguous tasks such as text analysis, ambiguity can be reduced by considering more plansi-. hie scenarios first. Default reasoning is problematic for firstorder logic when allo...

In recent years, various formalizations of non-monotonic reasoning and diierent semantics for normal and disjunctive logic programs have been proposed, including autoepistemic stationary and static semantics of normal and disjunctive logic programs. In this paper we introduce a simple non-monotonic knowledge representation framework which isomorphically contains all of the above mentioned non-m...

In recent years, many cryptography protocols have been designed, for many different scenarios, with the purpose of preserving security of communications as well as privacy and anonymity of participant entities. In general, every proposed solution has possed a real challenge to the existing formal methods of protocol analysis and verification. The main goal of this work is the proposal of a logi...

We present a method for relevance sensitive nonmonotonic inference from belief sequences which incorporates insights pertaining to prioritized inference and relevance sensitive, inconsistency tolerant belief revision. Our model uses a finite, logically open sequence of propositional formulas as a representation for beliefs and defines a notion of inference from maxiconsistent subsets of formula...