1320 search results - page 205 / 264 » Efficient Implementation of a Linear Logic Programming Langu... |
141
Voted
AAAI
2006
15 years 4 months ago
2006
Recent research shows that SAT (propositional satisfiability) techniques can be employed to build efficient systems to compute answer sets for logic programs. ASSAT and CMODELS ar...
224
click to vote
CP
2009
Springer
16 years 3 months ago
2009
Springer
Abstract. Today's models for propagation-based constraint solvers require propagators as implementations of constraints to be at least contracting and monotonic. These models ...
130
click to vote
EACL
2009
ACL Anthology
16 years 3 months ago
2009
ACL Anthology
We present a unified view of many translation algorithms that synthesizes work on deductive parsing, semiring parsing, and efficient approximate search algorithms. This gives rise...
154
Voted
EMNLP
2011
14 years 2 months ago
2011
In this paper, we propose a novel approach to automatic generation of aspect-oriented summaries from multiple documents. We first develop an event-aspect LDA model to cluster sen...
113
click to vote
APLAS
2005
ACM
15 years 8 months ago
2005
ACM
This paper presents a novel method to construct a dynamic single assignment (DSA) form of array-intensive, pointer-free C programs (or in any other procedural language). A program ...