Sciweavers

2062 search results - page 89 / 413
» Derivatives of Logical Formulas
Sort
View
132
Voted
AAAI
2006
15 years 5 months ago
Unifying Logical and Statistical AI
Intelligent agents must be able to handle the complexity and uncertainty of the real world. Logical AI has focused mainly on the former, and statistical AI on the latter. Markov l...
Pedro Domingos, Stanley Kok, Hoifung Poon, Matthew...
131
Voted
CORR
2010
Springer
202views Education» more  CORR 2010»
15 years 3 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...
129
Voted
JLP
2008
81views more  JLP 2008»
15 years 3 months ago
Cut-free sequent systems for temporal logic
Currently known sequent systems for temporal logics such as linear time temporal logic and computation tree logic either rely on a cut rule, an invariant rule, or an infinitary ru...
Kai Brünnler, Martin Lange
128
Voted
GRAMMARS
2000
97views more  GRAMMARS 2000»
15 years 3 months ago
Proof-Nets, Hybrid Logics and Minimalist Representations
Inthis paper, we aim at giving alogical account of the representationalist view on minimalist grammars by refering to the notion of Proof-Net in Linear Logic. We propose at the sam...
Alain Lecomte
120
Voted
MFCS
2005
Springer
15 years 9 months ago
The Complexity of Model Checking Higher Order Fixpoint Logic
This paper analyses the computational complexity of the model checking problem for Higher Order Fixpoint Logic – the modal µ-calculus enriched with a typed λ-calculus. It is ha...
Martin Lange, Rafal Somla