Sciweavers

827 search results - page 162 / 166
» Proof-Theoretic Soundness and Completeness
Sort
View
CONSTRAINTS
2010
116views more  CONSTRAINTS 2010»
13 years 6 months ago
Erratum to "Reformulating table constraints using functional dependencies - an application to explanation generation"
Abstract. We had claimed that arc-consistency is preserved in a constraint reformulation relying on functional dependencies (Theorem 2 of [2]). We show that the statement of this t...
Hadrien Cambazard, Barry O'Sullivan
ENTCS
2008
142views more  ENTCS 2008»
13 years 6 months ago
An Open System Operational Semantics for an Object-Oriented and Component-Based Language
Object orientation and component-based development have both proven useful for the elaboration of open distributed systems. These paradigms are offered by the Creol language. Creo...
Jasmin Christian Blanchette, Olaf Owe
ENTCS
2006
155views more  ENTCS 2006»
13 years 6 months ago
Mathematical Service Trading Based on Equational Matching
Mathematical software libraries provide many computational services. Mathematical operators properties can be used to combine several services in order to provide more complex one...
Aurélie Hurault, Marc Pantel
CORR
2007
Springer
126views Education» more  CORR 2007»
13 years 6 months ago
Linear Tabling Strategies and Optimizations
Recently there has been a growing interest of research in tabling in the logic programming community because of its usefulness in a variety of application domains including progra...
Neng-Fa Zhou, Taisuke Sato, Yi-Dong Shen
JAR
2006
94views more  JAR 2006»
13 years 6 months ago
Answer Set Programming Based on Propositional Satisfiability
Answer Set Programming (ASP) emerged in the late 1990s as a new logic programming paradigm which has been successfully applied in various application domains. Also motivated by the...
Enrico Giunchiglia, Yuliya Lierler, Marco Maratea