This paper studies the relationship between logic programs and term rewriting systems (TRSs). A compositional transform is de ned which given a logic program computes a TRS. For a...
We give a semantic account of the execution time (i.e. the number of cut elimination steps leading to the normal form) of an untyped MELL net. We first prove that: 1) a net is he...
Daniel de Carvalho, Michele Pagani, Lorenzo Tortor...
We investigate mca-programs, that is, logic programs with clauses built of monotone cardinality atoms of the form kX , where k is a non-negative integer and X is a finite set of ...
Signed conjunctive normal form (signed CNF) is a classical conjunctive clause form using a generalized notion of literal, called signed atom. A signed atom is an expression of the...