Defeasible specifications in action theories

Authors:
Chitta Baral;Jorge Lobo
Affiliations:
Computer Science Department, University of Texas at El Paso, El Paso, Texas;Department of EECS, Univ. of Illinois at Chicago, Chicago, IL
Venue:
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Year:
1997

Citing 3
Cited 6

The frame problem in situation the calculus: a simple solution (sometimes) and a completeness result for goal regression

Artificial intelligence and mathematical theory of computation
Reasoning about actions: non-deterministic effects, constraints, and qualification

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
A qualitative model for temporal reasoning with incomplete information

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2

Alternating Fixpoint Theory for Logic Programs with Priority

CL '00 Proceedings of the First International Conference on Computational Logic
Handling defeasibilities in action domains

Theory and Practice of Logic Programming
Handling uncertainty and defeasibility in a possibilistic logic setting

International Journal of Approximate Reasoning
Challenges for action theories

Challenges for action theories
On action theory change

Journal of Artificial Intelligence Research
Preferential Reasoning for Modal Logics

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In order to rank the performance of machine learning algorithms, many researchers conduct experiments on benchmark data sets. Since most learning algorithms have domain-specific parameters, it is a popular custom to adapt these parameters to obtain a ...