1512 search results - page 183 / 303 » When Suboptimal Rules |
113
click to vote
LFP
1990
15 years 17 days ago
1990
Quest is a programming language based on impredicative type quantifiers and subtyping within a three-level structure of kinds, types and type operators, and values. The semantics ...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Open Answer Set Programming (OASP) is an attractive framework for integrating ontologies and rules. In general OASP is undecidable. In previous work we provided a tableau-based alg...
EJC
2010
14 years 11 months ago
2010
Each clone C on a fixed base set A determines a quasiorder on the set of all operations on A by the following rule: f is a C-minor of g if f can be obtained by substituting operati...
ENTCS
2010
14 years 11 months ago
2010
The validity/satisfiability problem for most propositional interval temporal logics is (highly) undecidable, under very weak assumptions on the class of interval structures in whi...
CORR
2006
Springer
14 years 11 months ago
2006
Springer
Abstract. We study the termination of rewriting modulo a set of equations in the Calculus of Algebraic Constructions, an extension of the Calculus of Constructions with functions a...