Sciweavers

746 search results - page 113 / 150
» Connectionist Propositional Logic
Sort
View
120
Voted
IJCAI
2007
15 years 5 months ago
Tractable Temporal Reasoning
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...
Clare Dixon, Michael Fisher, Boris Konev
119
Voted
FOIS
2006
15 years 5 months ago
Towards an ontology of agency and action From STIT to OntoSTIT+
Abstract. A variety of disciplines and research areas have separately studied the notions of action, agents and agency, but no integrated and well-developed formal ontology for the...
Nicolas Troquard, Robert Trypuz, Laure Vieu
126
Voted
AI
2002
Springer
15 years 3 months ago
On the computational complexity of assumption-based argumentation for default reasoning
ko et al. have recently proposed an abstract framework for default reasoning. Besides capturing most existing formalisms and proving that their standard semantics all coincide, th...
Yannis Dimopoulos, Bernhard Nebel, Francesca Toni
123
Voted
AAAI
1993
15 years 5 months ago
On the Adequateness of the Connection Method
Roughly speaking, adequatness is the property of a theorem proving method to solve simpler problems faster than more difficult ones. Automated inferencing methods are often not ad...
Antje Beringer, Steffen Hölldobler
176
Voted
LICS
1991
IEEE
15 years 7 months ago
On the Deduction Rule and the Number of Proof Lines
d Abstract) Maria Luisa Bonet∗ Samuel R. Buss∗ Department of Mathematics Department of Mathematics U.C. Berkeley U.C. San Diego Berkeley, California 94720 La Jolla, California ...
Maria Luisa Bonet, Samuel R. Buss