Sciweavers

4513 search results - page 515 / 903
» Logic programming with satisfiability
Sort
View
SEMWEB
2010
Springer
15 years 4 months ago
Declarative Semantics for the Rule Interchange Format Production Rule Dialect
Abstract. The Rule Interchange Format Production Rule Dialect (RIFPRD) is a W3C Recommendation to define production rules for the Semantic Web, whose semantics is defined operation...
Carlos Viegas Damásio, José Jú...
DIMACS
1996
15 years 8 months ago
Easier Ways to Win Logical Games
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
Ronald Fagin
ICALP
2009
Springer
16 years 7 months ago
Wireless Communication Is in APX
Abstract. In this paper we address a common question in wireless communication: How long does it take to satisfy an arbitrary set of wireless communication requests? This problem i...
Magnús M. Halldórsson, Roger Wattenh...
UM
2005
Springer
16 years 4 days ago
Constraint-Sensitive Privacy Management for Personalized Web-Based Systems
This research aims at reconciling web personalization with privacy constraints imposed by legal restrictions and by users’ privacy preferences. We propose a software product line...
Yang Wang 0005
CC
2004
Springer
122views System Software» more  CC 2004»
16 years 2 days ago
An Automata-Theoretic Algorithm for Counting Solutions to Presburger Formulas
We present an algorithm for counting the number of integer solutions to selected free variables of a Presburger formula. We represent the Presburger formula as a deterministic fin...
Erin Parker, Siddhartha Chatterjee