Sciweavers

1032 search results - page 42 / 207
» Extended Computation Tree Logic
Sort
View
CORR
2010
Springer
202views Education» more  CORR 2010»
14 years 9 months ago
The Complexity of Reasoning for Fragments of Autoepistemic Logic
Autoepistemic logic extends propositional logic by the modal operator L. A formula that is preceded by an L is said to be "believed". The logic was introduced by Moore ...
Nadia Creignou, Arne Meier, Michael Thomas, Heribe...
WOLLIC
2009
Springer
15 years 4 months ago
Algebraic Valuations as Behavioral Logical Matrices
Abstract. The newly developed behavioral approach to the algebraization of logics extends the applicability of the methods of algebraic logic to a wider range of logical systems, n...
Carlos Caleiro, Ricardo Gonçalves
TLCA
2001
Springer
15 years 2 months ago
Logical Properties of Name Restriction
We extend the modal logic of ambients described in [7] to the full ambient calculus, including name restriction. We introduce logical operators that can be used to make assertions ...
Luca Cardelli, Andrew D. Gordon
AAAI
2004
14 years 11 months ago
Making Argumentation More Believable
There are a number of frameworks for modelling argumentation in logic. They incorporate a formal representation of individual arguments and techniques for comparing conflicting ar...
Anthony Hunter
ACL
1992
14 years 11 months ago
Tense Trees as the "Fine Structure" of Discourse
We present a new compositional tense-aspect deindexing mechanism that makes use of tense trees as components of discourse contexts. The mechanism allows reference episodes to be c...
Chung Hee Hwang, Lenhart K. Schubert