The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
CHR Grammars (CHRGs) are a grammar formalism that provides a constraint-solving approach to language analysis, built on top of Constraint Handling Rules in the same way as Definite Clause Grammars (DCGs) on Prolog. CHRGs work bottom-up and add the following features when compared with DCGs: An inherent treatment of ambiguity without backtracking. Robust parsing; do not give up in case...
A-Prolog, Answer Set Programming or Stable Model Programming, is an important outcome of the theoretical work on Nonmonotonic Reasoning and AI applications of Logic Programming in the last 15 years. In the full version of this paper we study interesting applications of logic in the field of answer sets.
Linear numerical constraints and their first-order theory, whether defined over the reals or the integers, are basic tools that appear in many areas of Computer Science. This paper overviews a set of techniques based on finite automata that lead to decision procedures and other useful algorithms, as well as to a normal form, for the first-order linear theory of the integers, of the reals, and of the...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.