90 search results - page 11 / 18 » Narrowing and Rewriting Logic: from Foundations to Applicati... |
112
click to vote
STOC
2006
ACM
16 years 2 months ago
2006
ACM
Producing a small DNF expression consistent with given data is a classical problem in computer science that occurs in a number of forms and has numerous applications. We consider ...
126
click to vote
IDEAS
2010
IEEE
14 years 12 months ago
2010
IEEE
Abstract. We consider the class of applications that manage time series (TS) and propose a data model and a query language that let these applications manipulate TS data sets at a ...
110
click to vote
CADE
2004
Springer
16 years 2 months ago
2004
Springer
Deduction modulo is a theoretical framework for reasoning modulo a congruence on propositions. Computational steps are thus removed from proofs, thus allowing a clean separatation...
240
click to vote
POPL
2007
ACM
16 years 2 months ago
2007
ACM
Constraint Handling Rules (CHR) is a concurrent committedchoice constraint logic programming language to describe transformations (rewritings) among multi-sets of constraints (ato...
112
Voted
CSL
2006
Springer
15 years 5 months ago
2006
Springer
Based on natural deduction, Pure Type Systems (PTS) can express a wide range of type theories. In order to express proof-search in such theories, we introduce the Pure Type Sequent...