the proceedings contain 59 papers. the special focus in this conference is on Description, Modal and Temporal logics. the topics include: Program termination analysis by size-change graphs;SET cardholder registration;...
ISBN:
(纸本)3540422544
the proceedings contain 59 papers. the special focus in this conference is on Description, Modal and Temporal logics. the topics include: Program termination analysis by size-change graphs;SET cardholder registration;algorithms, datastructures and other issues in efficient automated deduction;NExpTime-complete description logics with concrete domains;exploiting pseudo models for TBox and ABox reasoning in expressive description logics;the inverse method implements the automata approach for modal satisfiability;deduction-based decision procedure for a clausal miniscoped fragment of FTL;tableaux for temporal description logic with constant domains;free-variable tableaux for constant-domain quantified modal logics with rigid and non-rigid designation;instructing equational set-reasoning with otter;NP-completeness of refutability by literal-once resolution;ordered resolution vs. connection graph resolution;a model-based completeness proof of extended narrowing and resolution;a resolution-based decision procedure for the two-variable fragment with equality;superposition and chaining for totally ordered divisible abelian groups;on the evaluation of indexing techniques for theorem proving;preferred extensions of argumentation frameworks;bunched logicprogramming;a top-down procedure for disjunctive well-founded semantics;a second-order theorem prover applied to circumscription;a system for non-monotonic reasoning withlogic programs under answer set semantics;conditional pure literal graphs;evaluating search heuristics and optimization techniques in propositional satisfiability;a system for deciding quantified boolean formulas satisfiability;a disconnection calculus theorem prover;more on implicit syntax;termination and reduction checking for higher-order logic programs;integrating connection-based theorem proving into interactive proof assistants and the extended least number heuristic.
the replacement is a very powerful transformation operation which - both within the functional paradigm as well as within the logicprogramming one - can mimic the most common transformation operations such as unfold,...
详细信息
ISBN:
(纸本)3540676287
the replacement is a very powerful transformation operation which - both within the functional paradigm as well as within the logicprogramming one - can mimic the most common transformation operations such as unfold, fold, switching, distribution. Because of this flexibility, it can be incorrect if used without specific applicability conditions. In this paper we present applicability conditions which ensure the correctness of the replacement operation in the context of Concurrent Constraint Programs. Furthermore we show that, under these conditions, the replacement generalizes boththe unfolding operation as well as a restricted form of folding operation.
the proceedings contain 27 papers. the special focus in this conference is on programming Languages and Systems. the topics include: functional nets;faithful translations between polyvariant flows and polymorphic type...
ISBN:
(纸本)3540672621
the proceedings contain 27 papers. the special focus in this conference is on programming Languages and Systems. the topics include: functional nets;faithful translations between polyvariant flows and polymorphic types;on the expressiveness of event notification in data-driven coordination languages;flow-directed closure conversion for typed languages;directional type checking for logic programs;formalizing implementation strategies for first-class continuations;correctness of java card method lookup via logical relations;compile-time debugging of c programs working on trees;a calculus for compiling and linking classes;abstract domains for universal and existential properties;a type system for bounded space and functional in-place update-extended abstract information flow as typed process behaviour;implementing groundness analysis with definite boolean functions;the correctness of type specialisation;type classes withfunctional dependencies;proofnets for languages with explicit control;a calculus for link-time compilation;improving the representation of infinite trees to deal with sets of trees;on the translation of procedures to finite machines;a kleene analysis of mobile ambients;a 3-part type inference engine;first-class structures for standard ML;constraint-based inter-procedural analysis of parallel programs;alias types;polyvariant flow analysis with constrained types and on exceptions versus continuations in the presence of state.
the proceedings contain 27 papers. the special focus in this conference is on Inductive logicprogramming. the topics include: Probabilistic relational models;inductive databases (abstract);some elements of machine le...
ISBN:
(纸本)3540661093
the proceedings contain 27 papers. the special focus in this conference is on Inductive logicprogramming. the topics include: Probabilistic relational models;inductive databases (abstract);some elements of machine learning (extended abstract);refinement operators can be (weakly) perfect;combining divide-and-conquer and separate-and-conquer for efficient and;effective rule induction;refining complete hypotheses in ILP;acquiring graphic design knowledge with nonmonotonic inductive learning;morphosyntactic tagging of Slovene using progol;experiments in predicting biodegradability;a first-order Bayesian classifier;building background knowledge into a refinement operator for inductive logicprogramming;a strong complete schema for inductive functionallogicprogramming;application of different learning methods to Hungarian part-of-speech tagging;combining lapis and wordnet for the learning of LR parsers with optimal semantic constraints;learning word segmentation rules for tag prediction;approximate ILP rules by back propagation neural network;rule evaluation measures: a unifying view;improving part-of-speech disambiguation rules by adding linguistic knowledge;on sufficient conditions for learnability of logic programs from positive data;a bounded search space of clausal theories;discovering new knowledge from graph data using inductive logicprogramming;analogical prediction;generalizing refinement operators to learn prenex conjunctive normal forms;theory recovery;instance based function learning;some properties of inverse resolution in normal logic programs;an assessment of ILP-assisted models for toxicology and the PTE-3 experiment.
A new IFLP schema is presented as a general framework for the induction of functionallogic programs (FLP). Since narrowing (which is the most usual operational semantics of FLP) performs a unification (mgu) followed ...
详细信息
We present a simple generic framework to solve constraints on any domain (finite or infinite) which has a lattice structure. the approach is based on the use of a single constraint similar to the indexicals used by CL...
详细信息
In this article we introduce the notion of Heyting completion in abstract interpretation. We prove that Heyting completion provides a model for Cousot9;s reduced cardinal power of abstract domains and that it suppl...
详细信息
In this article we introduce the notion of Heyting completion in abstract interpretation. We prove that Heyting completion provides a model for Cousot's reduced cardinal power of abstract domains and that it supplies a logical basis to specify relational domains for program analysis and abstract interpretation. We study the algebraic properties of Heyting completion in relation with other well-known domain transformers, like reduced product and disjunctive completion. this provides a uniform algebraic setting where complex abstract domains can be specified by simple logic formulas, or as solutions of recursive abstract domain equations, involving few basic operations for domain construction, all characterized by a clean logical interpretation. We apply our framework to characterize directionality and condensing in downward closed analysis of (constraint) logic programs.
this work presents the Brisk Machine, a machine model for the implementation of functional languages. It is especially designed to be flexible and dynamic, so that it can support a uniform and efficient implementation...
详细信息
the proceedings contain 23 papers. the topics discussed include: putting non-functional requirements into software architecture;reconciling system requirements and runtime behavior;from early to late formal requiremen...
ISBN:
(纸本)0818684399
the proceedings contain 23 papers. the topics discussed include: putting non-functional requirements into software architecture;reconciling system requirements and runtime behavior;from early to late formal requirements: a process-control case study;safety through security;traceability and modularity in software design;an exercise in formal reasoning about mobile communications;specification and implementation of a distributed planning and information system for courses based on story driven modelling;V&V through inconsistency tracking and analysis;a coordination model to specify systems including mobile agents;performance evaluation of a software architecture: a case study;software architecture directed behaviour analysis;incremental software development method based on abstract interpretation;towards an algebra of architectural connectors: a case study on synchronization for mobility;DESCARTES : an automatic programming system for algorithmically simple programs;methodological support for requirements elicitation and formal specification;modal logic as a design notation;and on the consequences of acting in the presence of inconsistency.
functional and logicprogramming are often taught in different courses so that students often do not understand the relationships between these declarative programming paradigms. this is mainly due to the different un...
详细信息
暂无评论