Sciweavers

536 search results - page 7 / 108
» A Translational Approach to Constraint Answer Set Solving
Sort
View
LPNMR
2005
Springer
15 years 5 months ago
On Modular Translations and Strong Equivalence
Given two classes of logic programs, we may be interested in modular translations from one class into the other that are sound wth respect to the answer set semantics. The main the...
Paolo Ferraris
89
Voted
CICLING
2007
Springer
15 years 5 months ago
Enhancing Cross-Language Question Answering by Combining Multiple Question Translations
One major problem of state-of-the-art Cross Language Question Answering systems is the translation of user questions. This paper proposes combining the potential of multiple transl...
Rita M. Aceves-Pérez, Manuel Montes-y-G&oac...
97
Voted
CAD
1998
Springer
14 years 11 months ago
Solving geometric constraint systems. II. A symbolic approach and decision of Rc-constructibility
Abstract. This paper reports a geometric constraint solving approach based on symbolic computation. With this approach, we can compute robust numerical solutions for a set of equat...
Xiao-Shan Gao, Shang-Ching Chou
ICLP
2009
Springer
16 years 9 days ago
On the Implementation of Weight Constraint Rules in Conflict-Driven ASP Solvers
Abstract. We present the first comprehensive approach to integrating cardinality and weight rules into conflict-driven ASP solving. We begin with a uniform, constraint-based charac...
Martin Gebser, Roland Kaminski, Benjamin Kaufmann,...
AAAI
2012
13 years 2 months ago
Reformulating Temporal Action Logics in Answer Set Programming
Temporal Action Logics (TAL) is a class of temporal logics for reasoning about actions. We present a reformulation of TAL in Answer Set Programming (ASP), and discuss some synergi...
Joohyung Lee, Ravi Palla