Although knowing the operating systems running in a network is becoming more and more important (mainly for security reasons), current operating system discovery tools are not sufficiently accurate to acquire the info...
详细信息
ISBN:
(纸本)9783642042379
Although knowing the operating systems running in a network is becoming more and more important (mainly for security reasons), current operating system discovery tools are not sufficiently accurate to acquire the information in a fully automated way. Many design choices explain this lack of accuracy, but they all come down to a poor knowledge representation scheme. In this paper, we study how answer set programming call he used to guide the design of a knowledge-oriented operating system discovery tool. the result is significantly more accurate than today's state of the art tools.
In order to capture the full fledge semantic of complicated product data model, the expressive language ALCNHR+K(D) is introduced. It cannot only be able to represent knowledge about concrete domain and constraints, b...
详细信息
ISBN:
(纸本)1595931120
In order to capture the full fledge semantic of complicated product data model, the expressive language ALCNHR+K(D) is introduced. It cannot only be able to represent knowledge about concrete domain and constraints, but also rules in some sense of closed world semantic model hypothesis. Also the paper investigates an extension to description logic (DL) based knowledge reasoning by means of decomposing and rewriting complicated hybrid concepts into partitions. We present an approach that automatically decomposes the whole knowledge base into description logic compatible one and constraints solver one. Our arguments are two-fold. First, complex DLs with powerful representation ability lack effective reasoning ability. Second, we are concerned with how to reason effectively withthe combination of inferences from distributed heterogeneous reasoner.
Well-known principles of induction include monotone induction and different sorts of non-monotone induction such as inflationary induction, induction over well-ordered sets and iterated induction. In this work, we def...
详细信息
ISBN:
(纸本)354020721X
Well-known principles of induction include monotone induction and different sorts of non-monotone induction such as inflationary induction, induction over well-ordered sets and iterated induction. In this work, we define a logic formalizing induction over well-ordered sets and monotone and iterated induction. Just as the principle of positive induction has been formalized in FO(LFP), and the principle of inflationary induction has been formalized in FO(IFP), this paper formalizes the principle of iterated induction in a new logic for Non-Monotone Inductive Definitions (NMID-logic). the semantics of the logic is strongly influenced by the well-founded semantics of logicprogramming. Our main result concerns the modularity properties of inductive definitions in NMID-logic. Specifically, we formulate conditions under which a simultaneous definition Delta of several relations is logically equivalent to a conjunction of smaller definitions Delta(1) boolean AND . . . boolean AND Delta(n) with disjoint sets of defined predicates. the difficulty of the result comes from the fact that predicates P-i and P-j defined in Delta(i) and Delta(j), respectively, may be mutually connected by simultaneous induction. Since logicprogramming and abductive logicprogramming under well-founded semantics are proper fragments of our logic, our modularity results are applicable there as well. As an example of application of our logic and theorems presented in this paper, we describe a temporal formalism, the inductive situation calculus, where causal dependencies axe naturally represented as rules of inductive definitions.
A novel and simple combination of inductive logicprogramming with swarm intelligence is presented. the Ant-FOIL tightly integrates the well-known inductive logicprogramming rule-learner FOIL with Ant Colony System m...
详细信息
ISBN:
(纸本)9781479986460
A novel and simple combination of inductive logicprogramming with swarm intelligence is presented. the Ant-FOIL tightly integrates the well-known inductive logicprogramming rule-learner FOIL with Ant Colony System meta-heuristic. the hypotheses construction is guided by the ACS stochastic local decision policy depends on pheromone and heuristic information. Experiments in applying Ant-FOIL to well-known benchmarks shows that Ant-FOIL performs better than either its baseline algorithm (FOIL), and is at the same time competitive with more sophisticated approaches (kFOIL, nFOIL and Aleph).
Spatial puzzles are interesting domains to investigate problem solving, since the reasoning processes involved in reasoning about spatial knowledge is one of the essential items for an agent to interact in the human e...
详细信息
ISBN:
(纸本)9781538680230
Spatial puzzles are interesting domains to investigate problem solving, since the reasoning processes involved in reasoning about spatial knowledge is one of the essential items for an agent to interact in the human environment. Withthis in mind, the goal of this work is to investigate the knowledge representation and reasoning process related to the solution of a spatial puzzle, the Fisherman's Folly, composed of flexible string, rigid objects and holes. To achieve this goal, the present paper uses heuristics (obtained after solving a relaxed version of the puzzle) to accelerate the learning process, while applying a method that combines Answer Set programming (ASP) with Reinforcement learning (RL), the oASP(MDP) algorithm, to find a solution to the puzzle. ASP is the logic language chosen to build the set of states and actions of a Markov Decision Process (MDP) representing the domain, where RL is used to learn the optimal policy of the problem.
We show how to deploy the CIFF System 4.0 for abductive logicprogramming with constraints in a number of applications, ranging from combinatorial applications to web management. We also compare the CIFF System 4.0 wi...
详细信息
ISBN:
(纸本)9783540721994
We show how to deploy the CIFF System 4.0 for abductive logicprogramming with constraints in a number of applications, ranging from combinatorial applications to web management. We also compare the CIFF System 4.0 with a number of logicprogramming tools, namely the A-System, the DLV system and the SMODELS system.
It is proposed to add bounded quantifications to Prolog. the main reason is one of natural expression, many algorithms are expressed more elegantly in a declarative way using bounded quantifications than using existin...
详细信息
ISBN:
(纸本)3540569448
It is proposed to add bounded quantifications to Prolog. the main reason is one of natural expression, many algorithms are expressed more elegantly in a declarative way using bounded quantifications than using existing means, i.e., recursion. In particular this is true for numerical algorithms, an area where Prolog has been virtually unsuccessful so far. Moreover, bounded quantification has been found to be at least as efficient as recursion, when applicable. We outline an implementation of bounded quantification through an extension of Warren's abstract Prolog machine and give performance figures relative to recursion. Finally, we have shown elsewhere that bounded quantification has a high potential for parallel implementation. One can often run the same program on a sequential computer and on several kinds of parallel computers.
In this paper, we describe our ongoing work on the application of the Aspect-Oriented programming paradigm to the problem of ontology modularization driven by overlapping modularization requirements. We examine common...
详细信息
In this paper, we describe our ongoing work on the application of the Aspect-Oriented programming paradigm to the problem of ontology modularization driven by overlapping modularization requirements. We examine commonalities between ontology modules and software aspects and propose an approach to applying the latter to the problem of a priori construction of modular ontologies and a posteriori ontology modularization.
this paper continues the line of research on representing actions, on the automation of commonsense reasoning and on planning that deals with causal theories and with action language C. We show here that many of the i...
详细信息
ISBN:
(纸本)3540667490
this paper continues the line of research on representing actions, on the automation of commonsense reasoning and on planning that deals with causal theories and with action language C. We show here that many of the ideas developed in that work can be formulated in terms of logic programs under the answer set semantics, without mentioning causal theories. the translations from C into logicprogrammingthat we investigate serve as a basis for the use of systems for computing answer sets to reason about action domains described in C and to generate plans in such domains.
TOOL PRESENTATION: the paper presents a semantic wiki, called Loki, with strong logical knowledge representation using rules. the system uses a coherent logic-based representation for semantic annotations of the conte...
详细信息
TOOL PRESENTATION: the paper presents a semantic wiki, called Loki, with strong logical knowledge representation using rules. the system uses a coherent logic-based representation for semantic annotations of the content and implementing reasoning procedures. the representation uses the logicprogramming paradigm and the Prolog programming language. the proposed architecture allows for rule-based reasoning in the wiki. It also provides a compatibility layer withthe popular Semantic MediaWiki platform, directly parsing its annotations.
暂无评论