Problem solving in ID-logic with aggregates: some experiments
نویسندگان
چکیده
The goal of the LP+ project at the K.U.Leuven is to design an expressive logic, suitable for declarative knowledge representation, and to develop intelligent systems based on Logic Programming technology for solving computational problems using the declarative specifications. The ID-logic is an integration of typed classical logic and a definition logic. Different abductive solvers for this language are being developed. This paper is a report of the integration of high order aggregates into ID-logic and the consequences on the solver
منابع مشابه
The IDP framework for declarative problem
The IDP framework is a declarative problem solving paradigm, in which the computational task is to expand a given finite interpretation of a set of symbols into a model of a given ID-logic theory, a classical logic theory extended with inductive definitions. This framework has been proposed as a general approach for solving finite domain problems. In this paper, we introduce a typed version of ...
متن کاملGeneralized iterative methods for solving double saddle point problem
In this paper, we develop some stationary iterative schemes in block forms for solving double saddle point problem. To this end, we first generalize the Jacobi iterative method and study its convergence under certain condition. Moreover, using a relaxation parameter, the weighted version of the Jacobi method together with its convergence analysis are considered. Furthermore, we extend a method...
متن کاملUse of Fuzzy Numbers for Assessing Problem Solving Skills
The importance of Problem Solving (PS) has been realized for such a long time that in a direct or indirect way affects our daily lives in many ways. Assessment cases appear frequently for PS skills which involve a degree of uncertainty and (or) ambiguity. Fuzzy logic, due to its nature of characterizing such cases with multiple values, offers rich resources for dealing with them. On ...
متن کاملRBF-Chebychev direct method for solving variational problems
This paper establishes a direct method for solving variational problems via a set of Radial basis functions (RBFs) with Gauss-Chebyshev collocation centers. The method consist of reducing a variational problem into a mathematical programming problem. The authors use some optimization techniques to solve the reduced problem. Accuracy and stability of the multiquadric, Gaussian and inverse multiq...
متن کاملAn approximative inference method for solving ∃∀SO satisfiability problems
This paper considers the fragment ∃∀SO of second-order logic. Many interesting problems, such as conformant planning, can be naturally expressed as finite domain satisfiability problems of this logic. Such satisfiability problems are computationally hard (Σ2 ) and many of these problems are often solved approximately. In this paper, we develop a general approximative method, i.e., a sound but i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره cs.AI/0003030 شماره
صفحات -
تاریخ انتشار 2000