We introduce special pseudo-models for the interval logic of proper subintervals over dense linear orderings. We prove finite model property with respect to such pseudo-models, and using that result we develop a decision procedure based on a sound, complete, and terminating tableau for that logic. The case of proper subintervals is essentially more complicated than the case of strict subinterva...

Temporal logic model checking is a veriication method for reactive systems. In global model checking , the truth of a formula (and its subformulae) is determined for all the states in the model. Local model checking procedures are designed for proving that a speciic state of the model satisses a given formula. This may avoid the exhaustive traversal of a model and can thus be applied also to in...

The paper studies new unit propagation based heuristics for Davis-Putnam-Loveland (DPL) procedure. These are the novel combinations of unit propagation and the usual "MaximumOccurrences in clauses of Minimum Size" heuristics. Based on the experimental evaluations of di erent alternatives a new simple unit propagation based heuristic is put forward. This compares favorably with the heuristics em...

We present in this paper an application of the ACL2 system to reason about propositional satisfiability provers. For that purpose, we present a framework where we define a generic transformation based SAT–prover, and we show how this generic framework can be formalized in the ACL2 logic, making a formal proof of its termination, soundness and completeness. This generic framework can be instanti...

In this paper we propose a formal specification of a persuasion protocol between autonomous agents using an approach based on social commitments and arguments. In order to be flexible, this protocol is defined as a combination of a set of conversation policies. These policies are formalized as a set of dialogue games. The protocol is specified using two types of dialogue games: entry dialogue g...

Model generation and minimal model generation is useful for fault analysis, verification of systems and validation of data models. Whereas for classical propositional and first-order logic several model minimization approaches have been developed and studied, for non-classical logic the topic has been much less studied. In this paper we introduce a minimal model generation calculus for multi-mo...

It is widely believed that a family n of unsatis able formulae proposed by Cook and Reckhow in their landmark paper (Proc. ACM Symp. on Theory of Computing, 1974) can be used to give a lower bound of 2 (2 n) on the proof size with analytic tableaux. This claim plays a key role in the proof that tableaux cannot polynomially simulate tree resolution. We exhibit an analytic tableau proof for n for...

We develop a conceptually clear, intuitive, and feasible decision procedure for testing satisfiability in the full multiagent epistemic logic CMAEL(CD) with operators for common and distributed knowledge for all coalitions of agents mentioned in the language. To that end, we introduce Hintikka structures for CMAEL(CD) and prove that satisfiability in such structures is equivalent to satisfiabil...

I have been studying the following work on description logic, which is closely related to my main work on extensions of order-sorted logic and logic programming [4, 3, 2]. Title: Negation in Description Logics: Contraries, Contradictories and Subcontraries (under submission) Abstract: We propose an alternative description logic ALC∼ with classical negation and strong negation. In particular, we...

This paper advances the design of a unified model for the representation of search in first-order clausal theorem proving, by extending to tableau-based subgoal-reduction strategies (e.g., model-elimination tableaux), the marked search-graph model, already introduced for ordering-based strategies, those that use (ordered) resolution, paramodulation/superposition, simplification, and subsumption...