Sciweavers

65 search results - page 11 / 13
» Handling Exceptions in nonmonotonic reasoning
Sort
View
JSAT
2006
108views more  JSAT 2006»
13 years 6 months ago
Translating Pseudo-Boolean Constraints into SAT
In this paper, we describe and evaluate three different techniques for translating pseudoboolean constraints (linear constraints over boolean variables) into clauses that can be h...
Niklas Eén, Niklas Sörensson
ICDCS
2006
IEEE
14 years 9 days ago
DNScup: Strong Cache Consistency Protocol for DNS
Effective caching in Domain Name System (DNS) is critical to its performance and scalability. Existing DNS only supports weak cache consistency by using the Time-To-Live (TTL) mec...
Xin Chen, Haining Wang, Shansi Ren
AAAI
1990
13 years 7 months ago
The Representation of Defaults in Cyc
This paper provides an account of the representation of defaults in Cyc and their semantics in terms of first order logic with reification. Default reasoning is a complex thing, a...
Ramanathan V. Guha
MKM
2007
Springer
14 years 12 days ago
Biform Theories in Chiron
An axiomatic theory represents mathematical knowledge declaratively as a set of axioms. An algorithmic theory represents mathematical knowledge procedurally as a set of algorithms....
William M. Farmer
CADE
2005
Springer
14 years 6 months ago
A Proof-Producing Decision Procedure for Real Arithmetic
We present a fully proof-producing implementation of a quantifier elimination procedure for real closed fields. To our knowledge, this is the first generally useful proof-producing...
Sean McLaughlin, John Harrison