We are extending the keyword–based query interface DdQl for relational databases which is based on contextual background knowledge such as suitable join conditions and which was proposed in [10]. In the previous pape...
详细信息
Answer Set programming (ASP) is a well-known AI formalism. Traditional ASP systems, that follow the 'ground&solve' approach, are intrinsically limited by the so-called grounding bottleneck. Basically, the ...
详细信息
is an extension of Answer Set programming (ASP) that enables the declarative and modular modeling of problems within the entire polynomial hierarchy. The first implementation of ASP(Q), known as qasp, utilized a trans...
详细信息
Predictive maintenance plays a key role in the core business of the industry due to its potential in reducing unexpected machine downtime and related cost. To avoid such issues, it is crucial to devise artificial inte...
详细信息
We present an approach to non-deterministic planning under full observability via Answer Set programming. The technique can synthesise compact policies, handle both fair and unfair actions simultaneously, and readily ...
详细信息
The area of product configuration has witnessed a growing demand for systems that can effectively guide users through the configuration process. These systems facilitate interactivity during configuration by combining...
详细信息
The λDat calculus brings together the power of functional and declarative logic programming in one language. In λDat, Datalog constraints are first-class values that can be constructed, passed around as arguments, r...
详细信息
logical English (LE) is a natural language syntax for pure Prolog and other logic programming languages, such as ASP and s(CASP). Its main applications until now have been to explore the representation of a wide range...
详细信息
Stochastic logic programming (Slp) and Distributional logic programming (Dlp) are two closely related probabilistic logic programming formalisms that have been previously studied in the context of machine learning. Th...
详细信息
Theory of strongly equivalent transformations is an essential part of the methodology of representing knowledge in answer set programming. Strong equivalence of two programs can be sometimes characterized as the possi...
详细信息
暂无评论