Sciweavers

461 search results - page 42 / 93
» Component-Based Answer Set Programming
Sort
View
CORR
2002
Springer
106views Education» more  CORR 2002»
13 years 7 months ago
Domain-Dependent Knowledge in Answer Set Planning
In this paper we consider three di erent kinds of domain dependent control knowledge (temporal, procedural and HTN-based) that are useful in planning. Our approach is declarative ...
Tran Cao Son, Chitta Baral, Tran Hoai Nam, Sheila ...
ASP
2001
Springer
13 years 11 months ago
Effect of knowledge representation on model based planning: experiments using logic programming encodings
In this paper we implement planning using answer set programming. We consider the action language A and its extensions. We show that when the domain is described using richer feat...
Le-Chi Tuan, Chitta Baral
JAIR
2008
104views more  JAIR 2008»
13 years 7 months ago
Sound and Complete Inference Rules for SE-Consequence
The notion of strong equivalence on logic programs with answer set semantics gives rise to a consequence relation on logic program rules, called SE-consequence. We present a sound...
Ka-Shu Wong
AI
2011
Springer
13 years 2 months ago
Stable models and circumscription
The concept of a stable model provided a declarative semantics for Prolog programs with negation as failure and became a starting point for the development of answer set programmi...
Paolo Ferraris, Joohyung Lee, Vladimir Lifschitz
ICDE
2012
IEEE
277views Database» more  ICDE 2012»
11 years 10 months ago
Aggregate Query Answering on Possibilistic Data with Cardinality Constraints
— Uncertainties in data arise for a number of reasons: when the data set is incomplete, contains conflicting information or has been deliberately perturbed or coarsened to remov...
Graham Cormode, Divesh Srivastava, Entong Shen, Ti...