This paper provides a new, decidable definition of the higherorder recursive path ordering in which type comparisons are made only when needed, therefore eliminating the need for the computability closure, and bound variables are handled explicitly, making it possible to handle recursors for arbitrary strictly positive inductive types.

In classical logics, the meaning of a formula is invariant with respect to the renaming of bound variables. This property, normally taken for granted, has been shown not to hold in the case of Independence Friendly (IF) logics. In this paper we argue that this is not an inherent characteristic of these logics but a defect in the way in which the compositional semantics given by Hodges for the r...

“prove((E,F),A,B,C,D) :!, prove(E,[F|A],B,C,D). prove((E;F),A,B,C,D) :!, prove(E,A,B,C,D), prove(F,A,B,C,D). prove(all(H,I),A,B,C,D) :!, \+length(C,D), copy_term((H,I,C),(G,F,C)), append(A,[all(H,I)],E), prove(F,E,B,[G|C],D). prove(A,_,[C|D],_,_) :((A= -(B); -(A)=B)) -> (unify(B,C); prove(A,[],D,_,_)). prove(A,[E|F],B,C,D) :prove(E,F,[A|B],C,D).” implements a first-order theorem prover based on...

We study a generalized version of the index calculus method for the discrete logarithm problem in Fq , when q = pn, p is a small prime and n→∞. The database consists of the logarithms of all irreducible polynomials of degree between given bounds; the original version of the algorithm uses lower bound equal to one. We show theoretically that the algorithm has the same asymptotic running time as ...

Let A be a well-formed formula of first-order modal logic whose only free variable is x. We shall use the following abbreviations: Mat(A) for (x)[OA * 0~A] Form(A) for (x)[DA vD-i] Ban(A) for ((x)DA) v ((x)U~A) Pred(A) for Form(A) v Mat(A). We read Mat(A), FormjA), and Ban(A) respectively as: "A is material", "A is formal", and "A is banal"; Pred(A) is the assertion of the Principle of Predica-...

A real-time process algebra, called ACSR, has been developed to facilitate the specification and analysis of real-time systems. ACSR supports synchronous timed actions and asynchronous instantaneous events. Timed actions are used to represent the usage of resources and to model the passage of time. Events are used to capture synchronization between processes. To be able to specify real-time sys...

Dependency quantified Boolean formulas (DQBF ) extend quantified Boolean formulas with Henkin-style partially ordered quantifiers. It has been shown that this is likely to yield more succinct representations at the price of a computational blow-up from PSPACE to NEXPTIME. In this paper, we consider dependency quantified Horn formulas (DQHORN ), a subclass of DQBF, and show that the computationa...

We use results on modal definability of first-order formulas to reduce the problem of answering conjunctive queries over knowledge bases (of any expressivity) to checking inconsistency of those knowledge bases extended with a number of ALCI concept assertions. This reduction has been shown to work for conjunctive queries without cycles that only involve bound variables. In this paper, we presen...

A syntax and semantics of types, terms and formulas for coalgebras of polynomial functors is developed, extending earlier work [4] on monomial coalgebras to include functors constructed using coproducts. A modified ultrapower construction for polynomial coalgebras is introduced, adapting the conventional ultrapower to retain only those states that evaluate observable terms in a standard way. A ...

Theodes of semantic interpretation which wish to capture as many generalizations as possible must face up to the manifoldly ambiguous and contextually dependent nature of word meaning? In this paper I present a two-level scheme of semantic interpretation in which the first level deals with the semantic consequences of'syntactic structure and the second with the choice of word meaning. On the fi...