3891 search results - page 510 / 779 » A logic for strategic reasoning |
CADE
2001
Springer
16 years 1 months ago
2001
Springer
Abstract. This paper presents a technique for automated theorem proving with free variable tableaux that does not require backtracking. Most existing automated proof procedures usi...
CADE
2001
Springer
16 years 1 months ago
2001
Springer
We present a tool deciding a fragment of set theory. It is designed to be easily accessible via the internet and intuitively usable by anyone who is working with sets to describe a...
85
Voted
CADE
2001
Springer
16 years 1 months ago
2001
Springer
A boolean formula in conjunctive normal form (CNF) F is refuted by literal?once resolution if the empty clause is inferred from F by resolving on each literal of F at most once. Li...
97
Voted
CADE
2001
Springer
16 years 1 months ago
2001
Springer
We propose the notion of rewriting modules in order to provide a structural and hierarchical approach of TRS. We define then relative dependency pairs built upon these modules whic...
93
Voted
PERCOM
2006
ACM
16 years 10 days ago
2006
ACM
In this paper we present an integrated view for modeling and reasoning for context applications using OWL DL. In our case study, we describe a task driven approach to model typica...