Sciweavers

662 search results - page 107 / 133
» Logic Programming with Ordered Disjunction
Sort
View
TPHOL
1999
IEEE
13 years 11 months ago
Three Tactic Theorem Proving
Abstract. We describe the key features of the proof description language of Declare, an experimental theorem prover for higher order logic. We take a somewhat radical approach to p...
Don Syme
CONCUR
2007
Springer
14 years 1 months ago
Asynchronous Games: Innocence Without Alternation
The notion of innocent strategy was introduced by Hyland and Ong in order to capture the interactive behaviour of λ-terms and PCF programs. An innocent strategy is defined as an ...
Paul-André Melliès, Samuel Mimram
ECSQARU
2007
Springer
14 years 1 months ago
Syntactic Propositional Belief Bases Fusion with Removed Sets
Abstract. The problem of merging multiple sources information is central in several domains of computer science. In knowledge representation for artificial intelligence, several a...
Julien Hué, Odile Papini, Eric Würbel
IFIP
1992
Springer
13 years 11 months ago
Intelligent Access to Data and Knowledge Bases via User's Topics of Interest
Retrieving relevant information in Data and Knowledge Bases containing a large number of di erent types of information is a non trivial problem. That is the reason why, in areas l...
Sylvie Cazalens, Robert Demolombe
POPL
2003
ACM
14 years 7 months ago
From symptom to cause: localizing errors in counterexample traces
There is significant room for improving users' experiences with model checking tools. An error trace produced by a model checker can be lengthy and is indicative of a symptom...
Thomas Ball, Mayur Naik, Sriram K. Rajamani