Sciweavers

191 search results - page 1 / 39
» Mappings Between Domain Models in Answer Set Programming
Sort
View
ASP
2003
Springer
13 years 8 months ago
Mappings Between Domain Models in Answer Set Programming
Integration of data is required when accessing multiple databases within an organization or on the WWW. Schema integration is required for database interoperability, but it is curr...
Stefania Costantini, Andrea Formisano, Eugenio G. ...
AI
2004
Springer
13 years 3 months ago
ASSAT: computing answer sets of a logic program by SAT solvers
We propose a new translation from normal logic programs with constraints under the answer set semantics to propositional logic. Given a normal logic program, we show that by addin...
Fangzhen Lin, Yuting Zhao
CLIMA
2006
13 years 5 months ago
Answer Set Programming for Representing and Reasoning About Virtual Institutions
It is recognised that institutions are potentially powerful means for making agent interactions effective and efficient, but institutions will only really be useful when, as in oth...
Owen Cliffe, Marina De Vos, Julian A. Padget
JELIA
2004
Springer
13 years 9 months ago
On the Relation Between ID-Logic and Answer Set Programming
This paper is an analysis of two knowledge representation extensions of logic programming, namely Answer Set Programming and ID-Logic. Our aim is to compare both logics on the leve...
Maarten Mariën, David Gilis, Marc Denecker
AAAI
2007
13 years 6 months ago
An Experimental Comparison of Constraint Logic Programming and Answer Set Programming
Answer Set Programming (ASP) and Constraint Logic Programming over finite domains (CLP(FD)) are two declarative programming paradigms that have been extensively used to encode ap...
Agostino Dovier, Andrea Formisano, Enrico Pontelli