In this paper, we focus on the combination of probabilistic logicprogramming withthe principle of maximum entropy. We start by dening probabilistic queries to probabilistic logic programs and their answer substituti...
详细信息
We introduce choice logic programs as negation-free datalog programs that allow rules to have exclusive-only (possibly empty) disjunctions in the head. Such programs naturally model decision problems where, depending ...
详细信息
ISBN:
(纸本)3540667490
We introduce choice logic programs as negation-free datalog programs that allow rules to have exclusive-only (possibly empty) disjunctions in the head. Such programs naturally model decision problems where, depending on a context, agents must make a decision, i.e. an exclusive choice out of several alternatives. It is shown that such a choice mechanism is in a sense equivalent with negation as supported in semi-negative ("normal") datalog programs. We also discuss an application where strategic games can be naturally formulated as choice programs: it turns out that the stable models of such programs capture exactly the set of Nash equilibria. We then consider the effect of choice on "negative information" that may be implicitly derived from a program. Based on an intuitive notion of unfounded set for choice programs. ive show that several results from (seminegative) disjunctive programs can be strengthened;characterizing the position of choice programs as an intermediate between simple positive programs and programs that allow for the explicit use of negation in the body of a rule.
the proceedings contain 188 papers. the topics discussed include: a software and hardware environment for developing ai applications on parallel processors;merging objects and logicprogramming: relational semantics;c...
the proceedings contain 188 papers. the topics discussed include: a software and hardware environment for developing ai applications on parallel processors;merging objects and logicprogramming: relational semantics;comments on Kornfeld’s equality for prolog: e-unification as a mechanism for augmenting the prolog search strategy;a knowledge-based framework for design;Saturn: an automatic test generation system for digital circuits;a rule-based system for document understanding;application of knowledge based systems technology to triple quadrupole mass spectrometry;a graph-oriented knowledge representation and unification technique for automatically selecting and invoking software functions;tweety–still flying: some remarks on abnormal birds, applicable rules and a default prover;representing actions with an assumption-based truth maintenance system;and automatic compilation of logical specifications into efficient programs.
In this paper, an improved gene expression-based clonal selection algorithm (IGE-CSA) is proposed, which is aimed at solving synthesis problems of combinational logic circuits. the encoding of gene expression programm...
详细信息
the proceedings contain 188 papers. the topics discussed include: a software and hardware environment for developing ai applications on parallel processors;merging objects and logicprogramming: relational semantics;c...
the proceedings contain 188 papers. the topics discussed include: a software and hardware environment for developing ai applications on parallel processors;merging objects and logicprogramming: relational semantics;comments on Kornfeld’s equality for prolog: e-unification as a mechanism for augmenting the prolog search strategy;a knowledge-based framework for design;Saturn: an automatic test generation system for digital circuits;a rule-based system for document understanding;application of knowledge based systems technology to triple quadrupole mass spectrometry;a graph-oriented knowledge representation and unification technique for automatically selecting and invoking software functions;tweety–still flying: some remarks on abnormal birds, applicable rules and a default prover;representing actions with an assumption-based truth maintenance system;and automatic compilation of logical specifications into efficient programs.
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.
In this paper we describe a first-order logic inference strategy based on information extracted from both conjunctive and disjunctive normal forms. We claim that the search problem for a proof can benefit from this fu...
详细信息
ISBN:
(纸本)3540420711
In this paper we describe a first-order logic inference strategy based on information extracted from both conjunctive and disjunctive normal forms. We claim that the search problem for a proof can benefit from this further information, extending the heuristic possibilities of resolution and connection proof methods.
A series of recent papers introduces a coalgebraic semantics for logicprogramming, where the behavior of a goal is represented by a parallel model of computation called coinductive tree. this semantics fails to be co...
详细信息
the proceedings contain 74 papers. the topics discussed include: ElectroLab: electronic laboratory system;evaluation of a numerical model using COMSOL multi-physics package;interactive design modules for logic design ...
ISBN:
(纸本)9781467394314
the proceedings contain 74 papers. the topics discussed include: ElectroLab: electronic laboratory system;evaluation of a numerical model using COMSOL multi-physics package;interactive design modules for logic design course;an algorithm for human modeling in information technology multimedia using human biometrics found in golden ratio, vitruvian man and Neufert;syllabus design for multimedia art and engineering education - problem oriented approach;an evaluation of an integrated e-portfolio model: the case of Bahrain teachers college;programming unplugged: bridging CS unplugged activities gap for learning key programming concepts;the effect of using a developed spoken social networking website on instructional technology students attitudes and habits in Egypt;the use of e-learning system in learning about architecture;and the impact of e-books on the printed books: e-books popularity, growth and future.
暂无评论