Sciweavers

344 search results - page 47 / 69
» Some Theorems We Should Prove
Sort
View
POPL
2008
ACM
14 years 8 months ago
High-level small-step operational semantics for transactions
Software transactions have received significant attention as a way to simplify shared-memory concurrent programming, but insufficient focus has been given to the precise meaning o...
Katherine F. Moore, Dan Grossman
WWW
2005
ACM
14 years 9 months ago
Debugging OWL ontologies
As an increasingly large number of OWL ontologies become available on the Semantic Web and the descriptions in the ontologies become more complicated, finding the cause of errors ...
Bijan Parsia, Evren Sirin, Aditya Kalyanpur
EOR
2002
100views more  EOR 2002»
13 years 8 months ago
A buyer-seller game model for selection and negotiation of purchasing bids
Selection and negotiation of purchasing bids is a complex decision making process that requires consideration of a variety of vendor attributes such as price, delivery performance...
Srinivas Talluri
PODS
1995
ACM
139views Database» more  PODS 1995»
14 years 2 days ago
Normalizing Incomplete Databases
Databases are often incomplete because of the presence of disjunctive information, due to con icts, partial knowledge and other reasons. Queries against such databases often ask q...
Leonid Libkin
CSL
2010
Springer
13 years 9 months ago
From Feasible Proofs to Feasible Computations
We shall discuss several situations in which it is possible to extract from a proof, be it a proof in a first-order theory or a propositional proof, some feasible computational inf...
Jan Krajícek