Learn More
The better known methods of semantic tableaux for deciding satisfiability in propositional linear temporal logic generate graphs in addition to classical trees. The test of satisfaction is made from the graph and it does not correspond with the application of rules in any calculus for PLTL. We present here a new method of semantic tableaux without using(More)
On one hand, traditional tableau systems for temporal logic (TL) generate an auxiliary graph that must be checked and (possibly) pruned in a second phase of the refutation procedure. On the other hand, traditional sequent calculi for TL make use of a kind of inference rules (mainly, invariant-based rules or infinitary rules) that complicates their(More)
Sequent calculi usually provide a general deductive setting that uniformly embeds other proof-theoretical approaches, such as tableaux methods, resolution techniques, goal-directed proofs, etc. Unfortunately, in temporal logic, existing sequent calculi make use of a kind of inference rules that prevent the effective mechanization of temporal deduction in(More)
In this paper, we present Adimen-SUMO, an operational ontology to be used by first-order theorem provers in intelligent systems that require sophisticated reasoning capabilities (e.g. Natural Language Processing, Knowledge Engineering, Semantic Web infrastructure, etc.). Adimen-SUMO has been obtained by automatically translating around 88% of the original(More)
In this paper, we present a new proposal for an efficient implementation of constructive negation. In our approach the answers for a literal are bottom-up computed by solving equality constraints, instead of by handling frontiers of subsidiary computation trees. The required equality constraints are given by Shepherdson's operators which are, in a sense,(More)
A strong (L) logic programming language ([14, 15]) is given by two subclasses of formulas (programs and goals) of the underlying logic L, provided that: firstly, any program P (viewed as a L-theory) has a canonical model MP which is initial in the category of all its L-models; secondly, the L-satisfaction of a goal G in MP is equivalent to the(More)
The aim of our work is the definition of composit ional semantics for modula r units over the class o f normal logic programs. In this sense, we propose a declarative semantics for ~aormal logic programs in terms of model classes that is monoton ic in the sense that Mod(P t_J P') C Mocl(P), for any programs P and P', and we show that in the model class(More)
Resolution is a well-known proof method for classical logics that is well suited for mechanization. The most fruitful approach in the literature on temporal logic, which was started with the seminal paper of M. Fisher, deals with Propositional Linear-time Temporal Logic (PLTL) and requires to generate invariants for performing resolution on eventualities.(More)
We define a sound and complete logic, called FO⊃, which extends classical first-order predicate logic with intuitionistic implication. As expected, to allow the interpretation of intuitionistic implication, the semantics of FO⊃ is based on structures over a partially ordered set of worlds. In these structures, classical quantifiers and connectives (in(More)
In this paper, we propose a new approach to define temporal logic programming languages based on a temporal extension of resolution. We introduce the very expressive language TeDiLog that allows both eventualities and always formulas to occur in the head and also in the body of clauses. The operational semantics of TeDiLog is formulated on the basis of a(More)