this paper presents a new program analysis framework to approximate call patterns and their results in functionallogic computations. We consider programs containing non-strict, nondeterministic operations in order to...
详细信息
the proceedings contain 25 papers. the topics discussed include: order-sorted dependency pairs;macros for context-free grammars;inferring precise polymorphic type dependencies in logic programs;a type system for safe ...
ISBN:
(纸本)9781605581170
the proceedings contain 25 papers. the topics discussed include: order-sorted dependency pairs;macros for context-free grammars;inferring precise polymorphic type dependencies in logic programs;a type system for safe memory management and its proof of correctness;programming with proofs and explicit contexts;towards execution time estimation in abstract machine-based languages;similarity-based reasoning in qualified logicprogramming;classifying integrity checking methods with regard to inconsistency tolerance;comprehending finite maps for algorithmic debugging of higher-order functional programs;parallel execution of multi-set constraint rewrite rules;a rewriting framework for the composition of access control policies;global difference constraint propagation for finite domain solvers;and dynamic variable elimination during propagation solving.
We introduce a knowledge representation language AC(C) extending the syntax and semantics of ASP and CR-Prolog, give some examples of its use, and present an algorithm, ACsolver, for computing answer sets of AC(C) pro...
详细信息
We introduce a knowledge representation language AC(C) extending the syntax and semantics of ASP and CR-Prolog, give some examples of its use, and present an algorithm, ACsolver, for computing answer sets of AC(C) programs. the algorithm does not require full grounding of a program and combines "classical" ASP solving methods with constraint logicprogramming techniques and CR-Prolog based abduction. the AC(C) based approach often allows to solve problems which are impossible to solve by more traditional ASP solving techniques. We believe that further investigation of the language and development of more efficient and reliable solvers for its programs can help to substantially expand the domain of applicability of the answer set programming paradigm.
We present a new analysis that infers polymorphic type dependencies in logic programs. the analysis infers more precise information than previous type dependency inference analyses. the improvement in precision is ach...
详细信息
Blair et al. (2001) developed an extension of logicprogramming called set based logicprogramming. In the theory of set based logicprogrammingthe atoms represent subsets of a fixed universe X and one is allowed to ...
详细信息
Blair et al. (2001) developed an extension of logicprogramming called set based logicprogramming. In the theory of set based logicprogrammingthe atoms represent subsets of a fixed universe X and one is allowed to compose the one-step consequence operator with a monotonic idempotent operator O so as to ensure that the analogue of stable models in the theory are always closed under O. Marek et al. (1992, Ann Pure Appl logic 96:231-276 1999) developed a generalization of Reiter's normal default theories that can be applied to both default theories and logic programs which is based on an underlying consistency property. In this paper, we show how to extend the normal logicprogramming paradigm of Marek, Nerode, and Remmel to set based logicprogramming. We also show how one can obtain a new semantics for set based logicprogramming based on a consistency property.
We introduce a knowledge representation language AC(C) extending the syntax and semantics of ASP and CR-Prolog, give some examples of its use, and present an algorithm, ACsolver, for computing answer sets of AC(C) pro...
详细信息
We introduce a knowledge representation language AC(C) extending the syntax and semantics of ASP and CR-Prolog, give some examples of its use, and present an algorithm, ACsolver, for computing answer sets of AC(C) programs. the algorithm does not require full grounding of a program and combines "classical" ASP solving methods with constraint logicprogramming techniques and CR-Prolog based abduction. the AC(C) based approach often allows to solve problems which are impossible to solve by more traditional ASP solving techniques. We believe that further investigation of the language and development of more efficient and reliable solvers for its programs can help to substantially expand the domain of applicability of the answer set programming paradigm.
this paper presents a computational model for the cooperation of constraint domains, based on a generic Constraint functionallogicprogramming (CFLP) Scheme and designed to support declarative programming with functi...
详细信息
Recent research in nonmonotonic logicprogramming has focused on certain types of program equivalence, which we refer to here as hyperequivalence, that are relevant for program optimization and modular programming. So...
详细信息
Recent research in nonmonotonic logicprogramming has focused on certain types of program equivalence, which we refer to here as hyperequivalence, that are relevant for program optimization and modular programming. So far, most results concern hyperequivalence relative to the stable-model semantics. However, other semantics for logic programs are also of interest, especially the semantics of supported models which, when properly generalized, is closely related to the autoepistemic logic of Moore. In this paper, we consider a family of hyperequivalence relations for programs based on the semantics of supported and supported minimal models. We characterize these relations in model-theoretic terms. We use the characterizations to derive complexity results concerning testing whether two programs are hyperequivalent relative to supported and supported minimal models.
this paper explores a new point in the design space of functionalprogramming: functionalprogramming with dependently-typed higher-order data structures described in the logical framework LF. this allows us to progra...
详细信息
暂无评论