4401 search results - page 393 / 881 » Computing with Default Logic |
188
click to vote
SAT
2005
Springer
16 years 7 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...
201
click to vote
SEMWEB
2004
Springer
16 years 3 days ago
2004
Springer
The standardization of the second generation Web Ontology Language, OWL, leaves a crucial issue for Web-based ontologies unsatisfactorily resolved: how to represent and reason with...
160
click to vote
IJCAI
2007
15 years 8 months ago
2007
Temporal reasoning is widely used within both Computer Science and A.I. However, the underlying complexity of temporal proof in discrete temporal logics has led to the use of simp...
169
click to vote
DIMACS
1996
15 years 8 months ago
1996
There is a growing recognition of the need to apply formal mathematical methods in the design of \high con dence" computing systems. Such systems operate in safety critical co...
214
click to vote
ENTCS
2006
15 years 6 months ago
2006
This paper presents a game semantics for LP, Artemov's Logic of Proofs. The language of LP extends that of propositional logic by adding formula-labeling terms, permitting us...