1435 search results - page 130 / 287 » Description Logics |
133
click to vote
CP
2005
Springer
15 years 9 months ago
2005
Springer
Local search is a powerful and well-established method for solving hard combinatorial problems. Yet, until recently, it has provided very little user support, leading to time-consu...
137
click to vote
LICS
1999
IEEE
15 years 8 months ago
1999
IEEE
An important open question in complexity theory is whether the circuit complexity class TC0 is (strictly) weaker than LOGSPACE. This paper considers this question from the viewpoi...
144
click to vote
AICOM
2006
15 years 4 months ago
2006
This paper presents an overview of recent systems for Inductive Logic Programming (ILP). After a short description of the two popular ILP systems FOIL and Progol, we focus on meth...
139
click to vote
SYNTHESE
2011
14 years 11 months ago
2011
Dynamic epistemic logics describe the epistemic consequences of actions. Public announcement logic, in particular, describe the consequences of public announcements. As such, thes...
182
click to vote
ARGMAS
2009
Springer
15 years 10 months ago
2009
Springer
We describe a working multi-agent architecture based on Defeasible Logic Programming (DeLP) by Garc´ıa and Simari where agents are engaged in an argumentation to reach a common c...