Sciweavers

4978 search results - page 80 / 996
» Logical models of argument
Sort
View
130
Voted
FOCS
1997
IEEE
15 years 7 months ago
Randomized and Deterministic Algorithms for the Dimension of Algebraic Varieties
We prove old and new results on the complexity of computing the dimension of algebraic varieties. In particular, we show that this problem is NP-complete in the Blum-Shub-Smale mo...
Pascal Koiran
115
Voted
RSA
2006
110views more  RSA 2006»
15 years 3 months ago
The degree sequences and spectra of scale-free random graphs
We investigate the degree sequences of scale-free random graphs. We obtain a formula for the limiting proportion of vertices with degree d, confirming non-rigorous arguments of Do...
Jonathan Jordan
143
Voted
COGSCI
2010
87views more  COGSCI 2010»
15 years 2 months ago
The Logical Problem of Language Acquisition: A Probabilistic Perspective
Natural language is full of patterns that appear to fit with general linguistic rules but are ungrammatical. There has been much debate over how children acquire these ‘‘ling...
Anne S. Hsu, Nick Chater
TABLEAUX
2007
Springer
15 years 9 months ago
A Tableau Method for Public Announcement Logics
Public announcement logic is an extension of multi-agent epistemic logic with dynamic operators to model the informational consequences of announcements to the entire group of agen...
Philippe Balbiani, Hans P. van Ditmarsch, Andreas ...
95
Voted
JOLLI
2008
83views more  JOLLI 2008»
15 years 3 months ago
Inessential Features, Ineliminable Features, and Modal Logics for Model Theoretic Syntax
While monadic second-order logic (MSO) has played a prominent role in model theoretic syntax, modal logics have been used in this context since its inception. When comparing propos...
Hans-Jörg Tiede