In this paper, we present the Enfragmo system for specifying and solving combinatorial search problems. It supports natural specification of problems by providing users with a rich language, based on an extension of f...
详细信息
ISBN:
(纸本)9783642287176
In this paper, we present the Enfragmo system for specifying and solving combinatorial search problems. It supports natural specification of problems by providing users with a rich language, based on an extension of first order logic. Enfragmo takes as input a problem specification and a problem instance and produces a propositional CNF formula representing solutions to the instance, which is sent to a SAT solver. Because the specification language is high level, Enfragmo provides combinatorial problem solving capability to users without expertise in use of SAT solvers or algorithms for solving combinatorial problems. Here, we describe the specification language and implementation of Enfragmo, and give experimental evidence that its performance is comparable to that of related systems.
In the area of data and knowledge management, ontology-based query answering (OB QA) is becoming more and more a relevant task [2,3]. In fact, many organizations and autonomous contributors are generating the so calle...
ISBN:
(纸本)9783642332029
In the area of data and knowledge management, ontology-based query answering (OB QA) is becoming more and more a relevant task [2,3]. In fact, many organizations and autonomous contributors are generating the so called “Web of Data”, making publicly available Semantic Web repositories built either from scratch or by translation of existing data in ontological form. Contemporarily, database technology providers – such as Oracle, Ontotext, and Ontoprise – have started to build ontological reasoning modules on top of their existing software. Ontological reasoning is also the goal of several research-based systems, such as Quest, Owlgres, Owlim, and QuOnto, just to cite a few.
Answer set programming is a programming paradigm where a given problem is formalized as a logic program whose answer sets correspond to the solutions to the problem. In this paper, we link answer set programming with ...
详细信息
Possibilistic logic is a well-known logic for reasoning under uncertainty, which is based on the idea that the epistemic state of an agent can be modeled by assigning to each possible world a degree of possibility, ta...
详细信息
We present a system capable of automatically solving combinatorial logic puzzles given in (simplified) English. It uses an ontology to represent the puzzles in ASP which is applicable to a large set of logic puzzles. ...
详细信息
In this paper we describe a logicprogramming based implementation of the OWL 2 RL fragment. We show how goals are used for querying, forward reasoning permits to infer new knowledge, and ontology inconsistency is han...
详细信息
We present a logicprogramming framework for moral reasoning under uncertainty. It is enacted by a coherent combination of our two previously implemented systems, Evolution Prospection for decision making, and P-log f...
详细信息
A large and complex knowledge base that models some aspect of the real world can rarely be fully specified. Two examples of such underspecification are that (i) some of the cardinality constraints are omitted;(ii) som...
详细信息
the proceedings contain 36 papers. the topics discussed include: ontology-based information and event extraction for business intelligence;modelling highly symmetrical molecules: linking ontologies and graphs;personal...
ISBN:
(纸本)9783642331848
the proceedings contain 36 papers. the topics discussed include: ontology-based information and event extraction for business intelligence;modelling highly symmetrical molecules: linking ontologies and graphs;personalizing and improving tag-based search in folksonomies;views and synthesis of cognitive maps;identification of the compound subjective rule interestingness measure for rule-based functional description of genes;automatic generation and learning of finite-state controllers;FactForge: data service or the diversity of inferred knowledge over LOD;from path-consistency to global consistency in temporal qualitative constraint networks;rule quality measure-based induction of unordered sets of regression rules;a study on the utility of parametric uniform crossover for adaptation of crossover operator;and decomposition, merging, and refinement approach to boost inductive logicprogramming algorithms.
this paper studies computational issues related to the problem of reasoning about action and change in timed domains by translating it into answer set programming paradigm. Based on this idea, we implement a new actio...
详细信息
暂无评论