this paper studies runtime verification of distributed asynchronous systems and presents a monitor generation procedure for this purpose, which allows three-valued monitoring. the properties used in the monitors are s...
详细信息
this paper presents a sequential model of bargaining based on abductive reasoning in ASP. We assume that each agent is represented by a logic program that encodes the background knowledge of the agent. Each agent has ...
详细信息
ISBN:
(纸本)9783642405648
this paper presents a sequential model of bargaining based on abductive reasoning in ASP. We assume that each agent is represented by a logic program that encodes the background knowledge of the agent. Each agent has a set of goals to achieve but these goals are normally unachievable without an agreement from the other agent. We design an alternating-offers procedure that shows how an agreement between two agents can be reached through a reasoning process based on answer set programming and abduction. We prove that the procedure converges to a Nash equilibrium if each player makes rational offer/counter-offer at each round.
inductivelogicprogramming (ILP) is effective for classification learning because it, constructs hypotheses combining background knowledge. On the other hand it makes the cost of search for hypothesis large. this pap...
详细信息
ISBN:
(纸本)9783540855644
inductivelogicprogramming (ILP) is effective for classification learning because it, constructs hypotheses combining background knowledge. On the other hand it makes the cost of search for hypothesis large. this paper proposes a method to prime hypothesis using a kind of semantic knowledge. When an ILP system uses a top-down search, after it, visits a clause (rule) it explore another clause by adding a condition. the added condition may he redundant with other conditions in the clause or the condition may causes the body of clause unsatisfied. We study to represent and use to treat the redundancy and unsatisfactory of conditions as meta-knowledge of predicates. In this paper we give a formalism of meta-knowledge and show to use it with an ILP algorithm. We also study a method to generate meta-knowledge automatically. the method generates meta-knowledge which controls redundancy and contradiction with respect to predicates by testing properties extensionally.
In Constraint programming, enumeration strategies (selection of a variable and a value of its domain) are crucial for resolution performances. We propose to use Local Search for guiding enumeration: we extend the comm...
详细信息
ISBN:
(纸本)3540409300
In Constraint programming, enumeration strategies (selection of a variable and a value of its domain) are crucial for resolution performances. We propose to use Local Search for guiding enumeration: we extend the common variable selection strategies of constraint programming and we achieve the value selection based on a Local Search. the experimental results are rather promising.
Recently, linear logic has been used to specify sequent calculus proof systems in such a way that the proof search in linear logic can yield proof search in the specified logic. Furthermore, the meta-theory of linear ...
详细信息
ISBN:
(纸本)354030553X
Recently, linear logic has been used to specify sequent calculus proof systems in such a way that the proof search in linear logic can yield proof search in the specified logic. Furthermore, the meta-theory of linear logic can be used to draw conclusions about the specified sequent calculus. For example, derivability of one proof system from another can be decided by a simple procedure that is implemented via bounded logicprogramming-style search. Also, simple and decidable conditions on the linear logic presentation of inference rules, called homogeneous and coherence, can be used to infer that the initial rules can be restricted to atoms and that cuts can be eliminated. In the present paper we introduce Llinda, a logical framework based on linear logic augmented with inference rules for definition (fixed points) and induction. In this way, the above properties can be proved entirely inside the framework. To further illustrate the power of Llinda, we extend the definition of coherence and provide a new, semi-automated proof of cut-elimination for Girard's logic of Unicity (LU).
Separation logic is a subset of the quantifier-free first order logic. It has been successfully used in the automated verification of systems that have large (or unbounded) integer-valued state variables, such as pipe...
详细信息
ISBN:
(纸本)354030553X
Separation logic is a subset of the quantifier-free first order logic. It has been successfully used in the automated verification of systems that have large (or unbounded) integer-valued state variables, such as pipelined processor designs and timed systems, In this paper, we present a fast decision procedure for separation logic, which combines Boolean satisfiability (SAT) with a graph based incremental negative cycle elimination algorithm. Our solver abstracts a separation logic formula into a Boolean formula by replacing each predicate with a Boolean variable. Transitivity constraints over predicates are detected from the constraint graph and added on a need-to basis. Our solver handles Boolean and theory conflicts uniformly at the Boolean level. the graph based algorithm supports not only incremental theory propagation, but also constant time theory backtracking without using a cumbersome history stack. Experimental results on a large set of benchmarks show that our new decision procedure is scalable, and outperforms existing techniques for this logic.
the proceedings contain 28 papers. the special focus in this conference is on Computer Science logic. the topics include: Trakhtenbrot theorem and fuzzy logic;descriptive complexity, lower bounds and linear time;testi...
ISBN:
(纸本)3540659226
the proceedings contain 28 papers. the special focus in this conference is on Computer Science logic. the topics include: Trakhtenbrot theorem and fuzzy logic;descriptive complexity, lower bounds and linear time;testing of finite state systems;on the power of quantifiers in first-order algebraic specification;on the effective semantics of nondeterministic, nonmonotonic, temporal logic databases;quantifiers and the system KE;monadic NP and graph minors;invariant definability and p/poly;an upper bound for minimal resolution refutations;on an optimal deterministic algorithm for SAT;characteristic properties of majorant-computability over the reals;normalization of typable terms by superdevelopments;monotone fixed-point types and strong normalization;computational adequacy in an elementary topos;logical relations and inductive/coinductive types;on the complexity of H-subsumption;complexity classes and rewrite systems with polynomial interpretation;RPO constraint solving is in NP;quantifier elimination in fuzzy logic and many-valued first-order logics with probabilistic semantics.
We report on preliminary research towards native algorithms for query answering over relational nonmonotonic Multi-Context Systems (MCS), i.e., algorithms that do not rely on computing equilibria. Inspired by techniqu...
详细信息
ISBN:
(纸本)9783642405648
We report on preliminary research towards native algorithms for query answering over relational nonmonotonic Multi-Context Systems (MCS), i.e., algorithms that do not rely on computing equilibria. Inspired by techniques for query answering in distributed answer set programming, we identify MCS settings where a generalized query answering algorithm is effective and efficient;confirmed by a preliminary evaluation on a real world application.
the proceedings contain 40 papers. the topics discussed include: an integer programming approach for the physician rostering problem;constraint reformulation for nurse rostering problems;a unified nurse rostering mode...
ISBN:
(纸本)9780992998424
the proceedings contain 40 papers. the topics discussed include: an integer programming approach for the physician rostering problem;constraint reformulation for nurse rostering problems;a unified nurse rostering model based on XHSTT;modeling history in nurse rostering;KHE18: a solver for nurse rostering;bi-criteria simulated annealing algorithms for the robust university course timetabling problem;scheduling matters some potential requirements for future rostering competitions from a practitioner's view;and optimizing mobility services.
We present a novel virtualization framework for rapid prototyping in parallel programming environments, without incurring notable performance penalty. the centerpiece of this approach is a high-level functional langua...
详细信息
暂无评论