Although Answer Set programming (ASP) systems are highly optimised, their performance is sensitive to the size of the input and the inference it encodes. We address this deficiency by introducing a new extension to AS...
详细信息
In this paper we continue the work on our extension of Answer Set programming by non-Herbrand functions and add to the language support for arithmetic expressions and various inequality relations over non-Herbrand fun...
详细信息
Arithmetic circuits arise in the context of weighted logicprogramming languages, such as Datalog with aggregation, or Dyna. A weighted logic program defines a generalized arithmetic circuit- the weighted version of a...
详细信息
Recently there has been an increasing interest in the bottom-up evaluation of the semantics of logic programs with complex terms. the main problem due to the presence of functional symbols in the head of rules is that...
详细信息
We present a Prolog program - the SAT solver of Howe and King - As a (pure) logic program with added control. the control consists of a selection rule (delays of Prolog) and pruning the search space. We construct the ...
详细信息
the proceedings contain 11 papers. the topics discussed include: translating NP-SPEC into ASP;SPARC – sorted asp with consistency restoring rules;utilizing asp for generating and visualizing argumentation frameworks;...
the proceedings contain 11 papers. the topics discussed include: translating NP-SPEC into ASP;SPARC – sorted asp with consistency restoring rules;utilizing asp for generating and visualizing argumentation frameworks;planning and scheduling in hybrid domains using answer set programming;eliminating unfounded set checking for HEX-programs;backdoors to normality for disjunctive logic programs;answer set programming for stream reasoning;and two new definitions of stable models of logic programs with generalized quantifiers.
We introduce the class of possibilistic nested logic programs. these possibilistic logic programs allow us to use nested expressions in the bodies and the heads of their rules. By considering a possibilistic nested lo...
详细信息
In this paper we present a novel method for preprocessing complex non-ground rules in answer set programming (ASP). Using a well-known result from the area of conjunctive query evaluation, we apply hypertree decomposi...
详细信息
In this paper we describe a sound and complete concurrent operational semantics for constraint functional logicprogramming languages which allows to model declarative applications in which the interaction between dem...
详细信息
We describe an application of Prolog: a type inference tool for the Q functional language. Q is a terse vector processing language, a descendant of APL, which is getting more and more popular, especially in financial ...
详细信息
暂无评论