Sciweavers

173 search results - page 18 / 35
» A Framework for Proving Contract-Equipped Classes
Sort
View
KR
2000
Springer
13 years 11 months ago
Reasoning with Axioms: Theory and Practice
When reasoning in description, modal or temporal logics it is often useful to consider axioms representing universal truths in the domain of discourse. Reasoning with respect to a...
Ian Horrocks, Stephan Tobies
PODS
2012
ACM
297views Database» more  PODS 2012»
11 years 10 months ago
Query-based data pricing
Data is increasingly being bought and sold online, and Webbased marketplace services have emerged to facilitate these activities. However, current mechanisms for pricing data are ...
Paraschos Koutris, Prasang Upadhyaya, Magdalena Ba...
ICLP
2005
Springer
14 years 1 months ago
Towards an Integration of Answer Set and Constraint Solving
Answer set programming (ASP for short) is a declarative problem solving framework that has been recently attracting the attention of researchers for its expressiveness and for its...
Sabrina Baselice, Piero A. Bonatti, Michael Gelfon...
FM
2003
Springer
88views Formal Methods» more  FM 2003»
14 years 28 days ago
Java Applet Correctness: A Developer-Oriented Approach
This paper presents experiments on formal validation of Java applets. It describes a tool that has been developed at the Gemplus Research Labs. This tool allows to formally prove J...
Lilian Burdy, Antoine Requet, Jean-Louis Lanet
COCO
2004
Springer
119views Algorithms» more  COCO 2004»
13 years 11 months ago
Tight Lower Bounds for Certain Parameterized NP-Hard Problems
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
Jianer Chen, Benny Chor, Mike Fellows, Xiuzhen Hua...