Assumable logicprogramming (alp), an extension of Answer Set programming (ASP), has been theoretically demonstrated to possess significant advantages in addressing problems involving incomplete information. therefore...
详细信息
Assumable logicprogramming (alp), an extension of Answer Set programming (ASP), has been theoretically demonstrated to possess significant advantages in addressing problems involving incomplete information. therefore...
详细信息
ISBN:
(数字)9798350368284
ISBN:
(纸本)9798350368291
Assumable logicprogramming (alp), an extension of Answer Set programming (ASP), has been theoretically demonstrated to possess significant advantages in addressing problems involving incomplete information. therefore, the development of alp solvers is urgently needed to facilitate further research and applications. this paper proposes a solving algorithm named Answer Set Based View Search (ASBVS) and its optimization to compute the results of alp programs. Based on this, the alpSolver has been implemented and integrated into an online platform for public use. this paper experimentally validates the correctness of the solving algorithm and confirms the advantages of alp in handling default information, indirect exception and abductive reasoning. Additionally, the experimental results demonstrate the effectiveness of the optimization algorithm, with a notable increase in efficiency as the problem scale increases.
this paper presents theoretical basis of a language system whose program is described as algebraic expressions and implemented as abstract state machine. the behaviors of the described expressions may be captured (wit...
详细信息
ISBN:
(纸本)9789897584275
this paper presents theoretical basis of a language system whose program is described as algebraic expressions and implemented as abstract state machine. the behaviors of the described expressions may be captured (withtheir models) as causing sequences for state transitions, where composition and alternation for state transitions are mechanized in algebraic structure. Monitoring facilities to the language system may be described with state concepts, as well. With respect to intuitionistic logic and logical program containing negatives, Heyting algebra expressions are taken rather than already established nonmonotonic reasoning programs with negations, where 3-valued domain may be of use for the undefined to be allowable such that positives and negatives may be consistently evaluated, instead of rigid 2-valued settlements. We may have a standard form of Heyting algebra expressions in accordance to logical and AI programming, where the expressions are constrained with states. the states may be regarded as environmental conditions or objects as in object-oriented programming. As regards 3-valued models of given expressions, monotonic mapping cannot be in general associated with, but some ways are presented to approximate fixed points of a mapping for the given expression. then the formal description of programs may be given with reference to state transitions, which is thought of as proposing a language system structure.
In this paper we propose an extension of logicprogramming (LP) where each default literal derived from the well-founded model is associated a justification represented as an algebraic expression. this expression cont...
详细信息
the proceedings contain 29 papers. the topics discussed include: exploiting algebraic laws to improve mechanized axiomatizations;positive fragments of coalgebraiclogics;many-valued relation lifting and moss' coal...
ISBN:
(纸本)9783642402050
the proceedings contain 29 papers. the topics discussed include: exploiting algebraic laws to improve mechanized axiomatizations;positive fragments of coalgebraiclogics;many-valued relation lifting and moss' coalgebraiclogic;saturated semantics for coalgebraiclogicprogramming;presenting distributive laws;interaction and observation: categorical semantics of reactive systems trough dialgebras;homomorphisms of coalgebras from predicate liftings;trace semantics via generic observations;full abstraction for fair testing in CCS;a simple case of rationality of escalation;coalgebras with symmetries and modeling quantum systems;from operational chu duality to coalgebraic quantum symmetry;noninterfering schedulers: when possibilistic noninterference implies probabilistic noninterference;and simulations and bisimulations for coalgebraic modal logics.
the proceedings contain 55 papers. the special focus in this conference is on programming Issues and Software Engineering. the topics include: A grand challenge for computing research;linear types for cashflow reengin...
ISBN:
(纸本)3540208135
the proceedings contain 55 papers. the special focus in this conference is on programming Issues and Software Engineering. the topics include: A grand challenge for computing research;linear types for cashflow reengineering;storing properties in grouped tagged tuples;a polymorphic radix-n framework for fast fourier transforms;intersecting classes and prototypes;making software more flexible;program construction in the context of evolutionary computation;a layered architecture sustaining model-driven and event-driven software development;the outside-in method of teaching introductory programming;numeric types in formal synthesis;on the possibility of provably secure obfuscating programs;verification-oriented language C-light and its structural operational semantics;application to synthesis of contracts;on the visualization and aesthetics of large graphs;data mappings in the model-view-controller pattern;the translation power of the futamura projections;a compiler generator for constraint logic programs;the supercompiler SCP4;partial evaluation for common intermediate language;verification of distributed dataspace architectures;using SPIN and STeP to verify business processes specifications;integrating tools for automatic program verification;open maps and trace semantics for timed partial order models;confidentiality for multithreaded programs via bisimulation;dynamic modification of system structures using LLPNs;principles for entity authentication;causality and replication in concurrent processes;event-driven traversal of logic circuits for re-evaluation of boolean functions in reactive systems;teams of pushdown automata;algebraic state machines: concepts and applications to security;combining aspects of reactive systems;OCL extended with temporal logic and the definition of transitive closure with OCL.
the proceedings contain 24 papers. the special focus in this conference is on Functional programming and logicprogramming. the topics include: A scalable architecture for proof-carrying code;parameterized logic progr...
ISBN:
(纸本)3540417397
the proceedings contain 24 papers. the special focus in this conference is on Functional programming and logicprogramming. the topics include: A scalable architecture for proof-carrying code;parameterized logic programs where computing meets learning;proving syntactic properties of exceptions in an ordered logical framework;a higher-order colon translation;compiling lazy functional programs based on the spineless tagless G-machine for the java virtual machine;a higher-order logicprogramming language with constraints;an effective bottom-up semantics for first-order linear logic programs;a framework for goal-directed bottom-up evaluation of functional logic programs;theoretical foundations for the declarative debugging of lazy functional logic programs;adding linear constrains over real numbers to curry;a complete selection function for lazy conditional narrowing;an abstract machine based system for a lazy narrowing calculus;incremental learning of functional logic programs;a general type inference framework for hindley/milner style systems;monadic encapsulation with stack of regions;well-typed logic programs are not wrong;a framework for analysis of typed logic programs;abstract compilation for sharing analysis;a practical partial evaluator for a multi-paradigm declarative language;a simple take on typed abstract syntax in ML-like languages;a simply typed context calculus with first-class environments and refining the barendregt cube using parameters.
Our approach of rule-based refinement(1) provides a formal description for the stepwise system development based on Petri nets. Rules with a left-hand and a right-hand side allow replacing subnets in a given algebraic...
详细信息
ISBN:
(纸本)3540672613
Our approach of rule-based refinement(1) provides a formal description for the stepwise system development based on Petri nets. Rules with a left-hand and a right-hand side allow replacing subnets in a given algebraic high-level net system. the extension of these rules supports the preservation of system properties. In this paper we extend the preservation of safety properties significantly. We define rules, that introduce new safety properties. In our new approach we propose first the verification of properties at the moment they can be expressed and then their preservation further on. Hence, properties can be checked as long as the system is still small. Moreover, introducing properties allows checking these for the relevant subpart only. Changes that are required later on can be treated the same way and hence preserve the system properties. Hence, we have made a step towards a formal technique for the stepwise system development during analysis and design.
the proceedings contain 22 papers. the special focus in this conference is on logicprogramming and Term Rewriting. the topics include: Toward the concurrent implementation of computational systems;logicprogramming o...
ISBN:
(纸本)3540617353
the proceedings contain 22 papers. the special focus in this conference is on logicprogramming and Term Rewriting. the topics include: Toward the concurrent implementation of computational systems;logicprogramming on negation as instantiation;independence in dynamically scheduled logic languages;heterogeneous constraint solving;a hierarchy of semantics for normal constraint logic programs;order-sorted termination;unravelings and ultra-properties;standardization theorem revisited;discrete normalization and standardization in deterministic residual structures;a language for the logical specification of processes and relations;a process algebra for synchronous concurrent constraint programming;an algebraic approach to mixins and modularity;a strict border for the decidability of e-unification for recursive functions;prime factorizations of abstract domains using first order logic;abstractions of uniform proofs;complementing logic program semantics;meaningless terms in rewriting;unique normal form property of higher-order rewriting systems;algebraic semantics for functional logicprogramming with polymorphic order-sorted types;specifying type systems and the semantic treatment of polymorphic specification languages.
the proceedings contain 28 papers. the special focus in this conference is on Computer Science logic. the topics include: Four-valued diagnoses for stratified knowledge-bases;on the subject reduction property for alge...
ISBN:
(纸本)3540631720
the proceedings contain 28 papers. the special focus in this conference is on Computer Science logic. the topics include: Four-valued diagnoses for stratified knowledge-bases;on the subject reduction property for algebraic type systems;bounded-variable fixpoint queries are PSPACE-complete;graph rewriting semantics for functional programming languages;an extension of models of axiomatic domain theory to models of synthetic domain theory;relative undecidability in term rewriting;extending models of second order predicate logic to models of second order dependent type theory;cut-free display calculi for relation algebras;computational aspects of arity hierarchies;weak semantics based on lighted button pressing experiments;monadic NP and built-in trees;optimization problems with approximation schemes;computational representations of herbrand models using grammars;social confluence in client-server systems;a type-free resource-aware a-calculus;inductive definitions with decidable atomic formulas;new intuitionistic logical constants and undecidability of the conservativeness problem.
暂无评论