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...
详细信息
Semi-autonomous driving, as it is already available today and will eventually become even more accessible, implies the need for driver and automation system to reliably work together in order to ensure safe driving. A...
详细信息
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...
详细信息
Answer-Set programming (ASP) has seen tremendous progress over the last two decades and is nowadays successfully applied in many real-world domains. However, for certain problems, the well-known ASP grounding bottlene...
详细信息
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...
详细信息
Recent studies have demonstrated that compilation-based techniques can be beneficial for evaluating Datalog and ASP programs. In this paper, we develop a compiler that is able to generate solvers for normal logic prog...
详细信息
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 ...
详细信息
The scheduling of periodic treatments consists of planning a care path over a period of several weeks, in which patients have to perform different treatments respecting a certain periodicity. Treatments must be assign...
详细信息
ILASP (Inductive Learning of Answer Set Programs) is a logic-based machine learning system. It makes use of existing knowledge base, containing anything known before the learning starts or even previously learned rule...
详细信息
We present StHorn, a novel technique for solving the satisfiability problem of CHCs, which works lazily and incrementally and is guided by the structure of the set of CHCs. Our technique is driven by the idea that a s...
详细信息
暂无评论