217 search results - page 34 / 44 » A Logic for Approximate First-Order Reasoning |
COMPSAC
1999
IEEE
13 years 11 months ago
1999
IEEE
The Brooks' Law says that adding manpower to a late software project makes it later. Brooks developed the law through observation of many projects and derived the generalizat...
CIE
2006
Springer
13 years 11 months ago
2006
Springer
We prove constructively (in the style of Bishop) that every monotone continuous function with a uniform modulus of increase has a continuous inverse. The proof is formalized, and a...
ECAI
2004
Springer
14 years 26 days ago
2004
Springer
Attempts to use finite models to guide the search for proofs by resolution and the like in first order logic all suffer from the need to trade off the expense of generating and m...
SAS
1992
Springer
13 years 11 months ago
1992
Springer
Abstract Constraint logic programming (CLP) is a generalization of the pure logic programming paradigm, having similar model-theoretic, fixpoint and operational semantics [9]. Sinc...
SAT
2005
Springer
14 years 29 days ago
2005
Springer
We introduce ApproxCount, an algorithm that approximates the number of satisfying assignments or models of a formula in propositional logic. Many AI tasks, such as calculating degr...