1559 search results - page 88 / 312 » Some Group Theory Problems |
152
click to vote
AI
2008
Springer
15 years 2 months ago
2008
Springer
Although classical first-order logic is the de facto standard logical foundation for artificial intelligence, the lack of a built-in, semantically grounded capability for reasonin...
113
click to vote
LICS
2008
IEEE
15 years 10 months ago
2008
IEEE
The question of whether there is a logic that captures polynomial time is the central open problem in descriptive complexity theory. In my talk, I will review the question and the...
111
click to vote
GG
2004
Springer
15 years 9 months ago
2004
Springer
There would seem to be a natural connection between graphs and information security. This is particularly so in the arena of access control and authorization. Research on applying ...
149
click to vote
ICALP
2007
Springer
15 years 8 months ago
2007
Springer
We study the definability of constraint satisfaction problems (CSP) in various fixed-point and infinitary logics. We show that testing the solvability of systems of equations over...
210
click to vote
SIGMOD
2005
ACM
16 years 4 months ago
2005
ACM
We review the notion of hypertree width, a measure of the degree of cyclicity of hypergraphs that is useful for identifying and solving efficiently easy instances of hard problems...