Sciweavers

2084 search results - page 61 / 417
» Set Constraints in Logic Programming
Sort
View
LPAR
1992
Springer
14 years 2 days ago
From the Past to the Future: Executing Temporal Logic Programs
We describe some of the techniques which have been used to implement METATEM, a programming language based on temporal logic, and address problems such as non-determinism and loopi...
Michael Fisher, Richard Owens
CLIMA
2004
13 years 9 months ago
Revising Knowledge in Multi-agent Systems Using Revision Programming with Preferences
In this paper we extend the Revision Programming framework--a logic-based framework to express and maintain constraints on knowledge bases-with different forms of preferences. Pref...
Inna Pivkina, Enrico Pontelli, Tran Cao Son
LPNMR
2005
Springer
14 years 1 months ago
Guarded Open Answer Set Programming
Open answer set programming (OASP) is an extension of answer set programming where one may ground a program with an arbitrary superset of the program’s constants. We define a ...
Stijn Heymans, Davy Van Nieuwenborgh, Dirk Vermeir
JAIR
2007
108views more  JAIR 2007»
13 years 8 months ago
Discovering Classes of Strongly Equivalent Logic Programs
We report on a successful experiment of computeraided theorem discovery in the area of logic programming with answer set semantics. Specifically, with the help of computers, we d...
Fangzhen Lin, Yin Chen
CORR
2010
Springer
123views Education» more  CORR 2010»
13 years 8 months ago
Loop Formulas for Description Logic Programs
Description Logic Programs (dl-programs) proposed by Eiter et al. constitute an elegant yet powerful formalism for the integration of answer set programming with description logic...
Yisong Wang, Jia-Huai You, Li-Yan Yuan, Yi-Dong Sh...