725 search results - page 25 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
193
click to vote
ICTL
1994
15 years 6 months ago
1994
Commonsense knowledge often omits the temporal incidence of facts, and even the ordering between occurrences is only available for some of their instances. Reasoning about the temp...
149
click to vote
DALT
2009
Springer
15 years 5 months ago
2009
Springer
We propose a framework to compute the utility of a proposal w.r.t. a preference set in a negotiation process. In particular, we refer to preferences expressed as weighted formulas ...
162
Voted
AI
2001
Springer
15 years 6 months ago
2001
Springer
The stable semantics has become a prime candidate for knowledge representation and reasoning. The rules associated with propositional logic programs and the stable semantics are no...
117
click to vote
JAPLL
2010
15 years 27 days ago
2010
We introduce the extended modal logic EML with regularity constraints and full Presburger constraints on the number of children that generalize graded modalities, also known as nu...
ACL
2001
15 years 3 months ago
2001
We provide a logical definition of Minimalist grammars, that are Stabler's formalization of Chomsky's minimalist program. Our logical definition leads to a neat relation...