Sciweavers

7139 search results - page 1193 / 1428
» Language Engineering in Practice
Sort
View
CP
2007
Springer
15 years 11 months ago
A Compression Algorithm for Large Arity Extensional Constraints
We present an algorithm for compressing table constraints representing allowed or disallowed tuples. This type of constraint is used for example in configuration problems, where t...
George Katsirelos, Toby Walsh
ICLP
2007
Springer
15 years 11 months ago
Automatic Correctness Proofs for Logic Program Transformations
Abstract. The many approaches which have been proposed in the literature for proving the correctness of unfold/fold program transformations, consist in associating suitable well-fo...
Alberto Pettorossi, Maurizio Proietti, Valerio Sen...
IFM
2007
Springer
101views Formal Methods» more  IFM 2007»
15 years 11 months ago
Translating FSP into LOTOS and Networks of Automata
Many process calculi have been proposed since Robin Milner and Tony Hoare opened the way more than 25 years ago. Although they are based on the same kernel of operators, most of th...
Gwen Salaün, Jeff Kramer, Frédé...
171
Voted
KI
2007
Springer
15 years 11 months ago
Extending Markov Logic to Model Probability Distributions in Relational Domains
Abstract. Markov logic, as a highly expressive representation formalism that essentially combines the semantics of probabilistic graphical models with the full power of first-orde...
Dominik Jain, Bernhard Kirchlechner, Michael Beetz
LPNMR
2007
Springer
15 years 11 months ago
Debugging ASP Programs by Means of ASP
Answer-set programming (ASP) has become an important paradigm for declarative problem solving in recent years. However, to further improve the usability of answer-set programs, the...
Martin Brain, Martin Gebser, Jörg Pührer...
« Prev « First page 1193 / 1428 Last » Next »