Sciweavers

6607 search results - page 279 / 1322
» Making TeX Work
Sort
View
140
Voted
LPNMR
2007
Springer
15 years 10 months ago
A Preference-Based Framework for Updating Logic Programs
Abstract. We present a framework for updating logic programs under the answer-set semantics that builds on existing work on preferences in logic programming. The approach is simple...
James P. Delgrande, Torsten Schaub, Hans Tompits
OTM
2007
Springer
15 years 10 months ago
Scalability of OWL Reasoning: Role condensates
In the last years, there has been an increasing interest in the performance of reasoning on the Semantic Web in presence of large ABoxes. Traditional reasoners make heavily use of ...
Sebastian Wandelt, Ralf Möller
SARA
2007
Springer
15 years 10 months ago
Tailoring Solver-Independent Constraint Models: A Case Study with Essence' and Minion
In order to apply constraint programming to a particular domain, the problem must first be modelled as a constraint satisfaction problem. There are typically many alternative mode...
Ian P. Gent, Ian Miguel, Andrea Rendl
SUM
2007
Springer
15 years 10 months ago
Finding Most Probable Worlds of Probabilistic Logic Programs
Abstract. Probabilistic logic programs have primarily studied the problem of entailment of probabilistic atoms. However, there are some interesting applications where we are intere...
Samir Khuller, Maria Vanina Martinez, Dana S. Nau,...
WABI
2007
Springer
123views Bioinformatics» more  WABI 2007»
15 years 10 months ago
Inverse Sequence Alignment from Partial Examples
When aligning biological sequences, the choice of parameter values for the alignment scoring function is critical. Small changes in gap penalties, for example, can yield radically ...
Eagu Kim, John D. Kececioglu