Sciweavers

382 search results - page 30 / 77
» Complexity and Expressive Power of Logic Programming
Sort
View
DLOG
2009
13 years 5 months ago
A Matter of Principles: Towards the Largest DLP Possible
Abstract. Description Logic Programs (DLP) have been described as a description logic (DL) that is in the "expressive intersection" of DL and datalog. This is a very weak...
Markus Krötzsch, Sebastian Rudolph
CORR
2004
Springer
136views Education» more  CORR 2004»
13 years 7 months ago
Automatic Generation of CHR Constraint Solvers
In this paper, we present a framework for automatic generation of CHR solvers given the logical specification of the constraints. This approach takes advantage of the power of tab...
Slim Abdennadher, Christophe Rigotti
ICPADS
1996
IEEE
13 years 12 months ago
Transactional programming for distributed agent systems
A new multiagent programmingparadigm based on the transactional logic model' is developed. This paradigm enables us to construct a Distributed agent transactional program (DA...
V. K. Murthy
KR
2010
Springer
14 years 15 days ago
From Preference Logics to Preference Languages, and Back
Preference logics and AI preference representation languages are both concerned with reasoning about preferences on combinatorial domains, yet so far these two streams of research...
Meghyn Bienvenu, Jérôme Lang, Nic Wil...
TLDI
2010
ACM
247views Formal Methods» more  TLDI 2010»
14 years 4 months ago
F-ing modules
ML modules are a powerful language mechanism for decomposing programs into reusable components. Unfortunately, they also have a reputation for being “complex” and requiring fa...
Andreas Rossberg, Claudio V. Russo, Derek Dreyer