393 search results - page 54 / 79 » Logic Programs with Classical Negation |
POPL
2010
ACM
13 years 8 months ago
2010
ACM
In this paper, we explore the potential of the theory of nested words for partial correctness proofs of recursive programs. Our conceptual contribution is a simple framework that ...
FLAIRS
2007
13 years 10 months ago
2007
Reasoning about preferences is a major issue in many decision making problems. Recently, a new logic for handling preferences, called Qualitative Choice Logic (QCL), was presented...
TABLEAUX
2005
Springer
14 years 2 months ago
2005
Springer
We extend classical first-order logic with subtyping by type predicates and type coercion. Type predicates assert that the value of a term belongs to a more special type than the ...
AAAI
2007
13 years 10 months ago
2007
Forgetting irrelevant/problematic actions in a domain description can be useful in solving reasoning problems, such as query answering, planning, conflict resolution, prediction,...
JELIA
2010
Springer
13 years 7 months ago
2010
Springer
Stable belief sets were introduced by R. Stalnaker in the early ’80s, as a formal representation of the epistemic state for an ideal introspective agent. This notion motivated M...