3970 search results - page 211 / 794 » A Logic For Causal Reasoning |
TIME
1994
IEEE
14 years 1 months ago
1994
IEEE
Pinto and Reiter have argued that the Situation Calculus, improved with time handling axioms, subsumes the features of linear time temporal formalisms such as Event Calculus and I...
DLOG
2003
13 years 11 months ago
2003
We present lower bounds on the computational complexity of satisfiability and subsumption in several description logics. We interpret these lower bounds as coming from different...
CADE
2005
Springer
14 years 10 months ago
2005
Springer
Abstract. We describe methods for automated theorem proving in extensional type theory with primitive equality. We discuss a complete, cut-free sequent calculus as well as a compac...
ADC
2004
Springer
14 years 3 months ago
2004
Springer
Forms are the most common way to interface users and Web-based applications. Traditional forms cannot provide the functionality needed to fulfil the requirements of complex appli...
SAT
2004
Springer
14 years 3 months ago
2004
Springer
The finite model generation problem in the first-order logic is a generalization of the propositional satisfiability (SAT) problem. An essential algorithm for solving the proble...