Sciweavers

82 search results - page 9 / 17
» CR-Prolog with Ordered Disjunction
Sort
View
CADE
2006
Springer
14 years 11 months ago
Extracting Programs from Constructive HOL Proofs Via IZF Set-Theoretic Semantics
Church's Higher Order Logic is a basis for proof assistants -- HOL and PVS. Church's logic has a simple set-theoretic semantics, making it trustworthy and extensible. We ...
Robert L. Constable, Wojciech Moczydlowski
ICDE
2010
IEEE
202views Database» more  ICDE 2010»
14 years 10 months ago
Ranked Queries over Sources with Boolean Query Interfaces without Ranking Support
Many online or local data sources provide powerful querying mechanisms but limited ranking capabilities. For instance, PubMed allows users to submit highly expressive Boolean keywo...
Panagiotis G. Ipeirotis, Vagelis Hristidis, Yuheng...
CP
2009
Springer
14 years 11 months ago
Propagator Groups
This paper introduces propagator groups as an abstraction for controlling the execution of propagators as implementations of constraints. Propagator groups enable users of a constr...
Mikael Z. Lagerkvist, Christian Schulte
MST
2008
124views more  MST 2008»
13 years 10 months ago
Complexity of Clausal Constraints Over Chains
We investigate the complexity of the satisfiability problem of constraints over finite totally ordered domains. In our context, a clausal constraint is a disjunction of inequaliti...
Nadia Creignou, Miki Hermann, Andrei A. Krokhin, G...
FTP
1998
Springer
14 years 3 months ago
Issues of Decidability for Description Logics in the Framework of Resolution
Abstract. We describe two methods on the basis of which efficient resolution decision procedures can be developed for a range of description logics. The first method uses an orderi...
Ullrich Hustadt, Renate A. Schmidt