2490 search results - page 206 / 498 » Complexity of Contextual Reasoning |
142
click to vote
SAGT
2010
Springer
15 years 3 months ago
2010
Springer
Can learning algorithms find a Nash equilibrium? This is a natural question for several reasons. Learning algorithms resemble the behavior of players in many naturally arising gam...
282
click to vote
FCSC
2011
14 years 8 months ago
2011
Description logics (DLs) are widely employed in recent semantic web application systems. However, classical description logics are limited when dealing with imprecise concepts and ...
132
click to vote
CADE
2006
Springer
16 years 5 months ago
2006
Springer
Linear arithmetic decision procedures form an important part of theorem provers for program verification. In most verification benchmarks, the linear arithmetic constraints are dom...
132
Voted
DATE
2003
IEEE
15 years 10 months ago
2003
IEEE
Managing the complexity of designing chips containing billions of transistors requires decoupling computation from communication. For the communication, scalable and compositional...
166
Voted
ASP
2003
Springer
15 years 10 months ago
2003
Springer
Disjunctive Logic Programming (DLP) is an advanced formalism for Knowledge Representation and Reasoning (KRR). DLP is very expressive in a precise mathematical sense: it allows to ...