Sciweavers

149 search results - page 12 / 30
» Encoding Planning Problems in Nonmonotonic Logic Programs
Sort
View
151
Voted
CORR
1998
Springer
126views Education» more  CORR 1998»
15 years 2 months ago
Stable models and an alternative logic programming paradigm
In this paper we reexamine the place and role of stable model semantics in logic programming and contrast it with a least Herbrand model approach to Horn programs. We demonstrate ...
Victor W. Marek, Miroslaw Truszczynski
ESWS
2005
Springer
15 years 8 months ago
Dually Structured Concepts in the Semantic Web: Answer Set Programming Approach
There is an ongoing discussion whether reasoning in the Semantic Web should be monotonic or not. It seems however that the problem concerns not only the reasoning over knowledge bu...
Patryk Burek, Rafal Grabos
AI
2004
Springer
15 years 2 months ago
On the revision of preferences and rational inference processes
Orderings and inference relations can be successfully used to model the behavior of a rational agent. This behavior is indeed represented either by a set of ordered pairs that ref...
Michael Freund
ICLP
2005
Springer
15 years 8 months ago
A Comparison of CLP(FD) and ASP Solutions to NP-Complete Problems
This paper presents experimental comparisons between declarative encodings of various computationally hard problems in both Answer Set Programming (ASP) and Constraint Logic Progra...
Agostino Dovier, Andrea Formisano, Enrico Pontelli
117
Voted
TCAD
2008
97views more  TCAD 2008»
15 years 2 months ago
Encoding Large Asynchronous Controllers With ILP Techniques
State encoding is one of the most difficult problems in the synthesis of asynchronous controllers. This paper presents a method that can solve the problem of large controllers spec...
Josep Carmona, Jordi Cortadella