A conflict clause represents a backtracking solver’s analysis of why a conflict occurred. this analysis can be used to further prune the search space and to direct the search heuristic. the use of such clauses has be...
详细信息
We investigate mca-programs, that is, logic programs with clauses built of monotone cardinality atoms of the form kX, where k is a non-negative integer and X is a finite set of propositional atoms. We develop a theory...
详细信息
In answer set programming, programs often contain auxiliary atoms, "defined" in terms of atoms introduced earlier. To prove that the answer sets of a program containing definitions correspond to the solution...
详细信息
Program synthesis is the systematic, usually automatic construction of correct and efficient executable code from declarative statements. Program synthesis is routinely used in industry to generate GUIs and for databa...
详细信息
ISBN:
(纸本)3540229418
Program synthesis is the systematic, usually automatic construction of correct and efficient executable code from declarative statements. Program synthesis is routinely used in industry to generate GUIs and for database support.
logic Programs with Annotated Disjunctions (LPADs) provide a simple and elegant framework for integrating probabilistic reasoning and logicprogramming. In this paper we propose an algorithm for learning LPADs. the le...
详细信息
ISBN:
(纸本)3540229418
logic Programs with Annotated Disjunctions (LPADs) provide a simple and elegant framework for integrating probabilistic reasoning and logicprogramming. In this paper we propose an algorithm for learning LPADs. the learning problem we consider consists in starting from a sets of interpretations annotated withtheir probability and finding one (or more) LPAD that assign to each interpretation the associated probability. the learning algorithm first finds all the disjunctive clauses that are true in all interpretations, then it assigns to each disjunct in the head a probability and finally decides how to combine the clauses to form an LPAD by solving a constraint satisfaction problem. We show that the learning algorithm is correct and complete.
the proceedings contain 21 papers. the special focus in this conference is on logic, Functional-logicprogramming, Applications, Program Analysis, Rewriting and Semantics. the topics include: A brief survey of quantum...
ISBN:
(纸本)354021402X
the proceedings contain 21 papers. the special focus in this conference is on logic, Functional-logicprogramming, Applications, Program Analysis, Rewriting and Semantics. the topics include: A brief survey of quantum programming languages;analysis of synchronous and asynchronous cellular automata using abstraction by temporal logic;online justification for tabled logic programs;a declarative debugging tool for functional logic languages;an effective self-applicable partial evaluator for prolog;multivariant non failure analysis via standard abstract interpretation;implementing natural rewriting and narrowing efficiently;complete axiomatization of an algebraic construction of graphs;semantics of linear continuation-passing in call-by-name;basic pattern matching calculi and derivation of deterministic inverse programs based on LR parsing.
the proceedings contain 25 papers. the special focus in this conference is on Artificial Intelligence and Symbolic Computation. the topics include: From matrix semantics to stochastic local search;planning and patchin...
ISBN:
(纸本)9783540232124
the proceedings contain 25 papers. the special focus in this conference is on Artificial Intelligence and Symbolic Computation. the topics include: From matrix semantics to stochastic local search;planning and patching proof;a paraconsistent higher order logic;abstraction within partial deduction for linear logic;a decision procedure for equality logic with uninterpreted functions;extending finite model searching with congruence closure computation;on the combination of congruence closure and completion;combination of nonlinear terms in interval constraint satisfaction techniques;proving and constraint solving in computational origami;an evolutionary local search method for incremental satisfiability;solving equations involving sequence variables and sequence functions;polynomial interpretations with negative coefficients;new developments in symmetry breaking in search using computational group theory;recognition of whitehead-minimal elements in free groups of large ranks;four approaches to automatedreasoning with differential algebraic structures;algorithm-supported mathematical theory exploration;two revision methods based on constraints;abstraction-driven verification of array programs and from a computer algebra library to a system with an equational prover.
We investigate a generalization of weight-constraint programs with stable semantics, as implemented in the ASP solver smodels. Our programs admit atoms of the form 〈X, F〉 where X is a finite set of propositional atoms...
详细信息
the generation and testing of hypotheses is widely considered to be the primary method by which Science progresses. So much so, that it is still common to find a scientific proposal or an intellectual argument damned ...
详细信息
ISBN:
(纸本)3540229418
the generation and testing of hypotheses is widely considered to be the primary method by which Science progresses. So much so, that it is still common to find a scientific proposal or an intellectual argument damned on the grounds that it has no hypothesis being tested, it is merely a fishing expedition, and so on. Extreme versions run if there is no hypothesis, it is not Science, the clear implication being that hypothesis-driven programmes (as opposed to data-driven studies) are the only contributor to the scientific endeavour. this misrepresents how knowledge and understanding are actually generated from the study of natural phenomena and laboratory experiments. Hypothesis-driven and inductive modes of reasoning are not competitive, but complementary, and both are required in post-genomic biology.
State-of-the-art rule-based tools for morphological disambiguation use either manually crafted rules or rules learnt from manually annotated data. this paper presents a new method of learning rules for morphological d...
详细信息
暂无评论