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...
详细信息
In this paper we consider privacy problems with anonymized transaction databases, i.e., transaction databases where the items are renamed in order to hide sensitive information. In particular, we show how an anonymize...
详细信息
ISBN:
(纸本)3540233571
In this paper we consider privacy problems with anonymized transaction databases, i.e., transaction databases where the items are renamed in order to hide sensitive information. In particular, we show how an anonymized transaction database can be deanonymized using non-anonymized frequent itemsets. We describe how the problem can be formulated as an integer programming task, study the computational complexity of the problem, discuss how the computations could be done more efficiently in practice and experimentally examine the feasibility of the proposed approach.
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...
详细信息
Answer Set programming is a new paradigm based on logic programming. the main component of answer set programming is a system that finds the answer sets of logic programs. During the computation of an answer set, syst...
详细信息
the allocation of airport time slot not only impacts the airlines' service level to passengers, but also influences airlines' profits of market share. therefore, this study attempts to present the optimal allo...
详细信息
the allocation of airport time slot not only impacts the airlines' service level to passengers, but also influences airlines' profits of market share. therefore, this study attempts to present the optimal allocation aspects of airport time slot for the passengers and airlines and considers the constraints of airport capacity at peak hours. this study proposes the optimal time allocation model by the bi-level programming to analyze the airport time slot issues. One outcome shows that if passenger is the leader and airline the follower, then the time slot of offshore island routes should be more than other routes. the other outcome shows that if the airline is a leader and passenger the follower, then the time slot will be prior to main-island route of longer distance. Both outcomes demonstrate that aviation is suitable to offshore island and long distance transportation.
the proceedings contain 16 papers. the topics discussed include: spam, damn spam, and statistics: using statistical analysis to locate spam web pages;querying bi-level information;visualizing and discovering web navig...
the proceedings contain 16 papers. the topics discussed include: spam, damn spam, and statistics: using statistical analysis to locate spam web pages;querying bi-level information;visualizing and discovering web navigational patterns;semantic multicast for content-based stream dissemination;twig query processing over graph-structured XML data;unraveling the duplicate-elimination problem in XML-to-SQL query translation;best-match querying from document-centric XML;challenges in selecting paths for navigational queries: trade-of of benefit of path versus cost of plan;content and structure in indexing and ranking XML;mining approximate functional dependencies and concept similarities to answer imprecise queries;DTDs versus XML schema: a practical study;on validation of XML streams using finite state machines;and checking potential validity of XML documents.
In this paper, we study how a logical form of scientific modelling that integrates together abduction and induction can be used to understand the functional class of unknown enzymes or inhibitors. We show how we can m...
详细信息
ISBN:
(纸本)3540229418
In this paper, we study how a logical form of scientific modelling that integrates together abduction and induction can be used to understand the functional class of unknown enzymes or inhibitors. We show how we can model, within Abductive Logic programming (ALP), inhibition in metabolic pathways and use abduction to generate facts about inhibition of enzymes by a particular toxin (e.g. Hydrazine) given the underlying metabolic pathway and observations about the concentration of metabolites. these ground facts, together with biochemical background information, can then be generalised by ILP to generate rules about the inhibition by Hydrazine thus enriching further our model. In particular, using Progol 5.0 where the processes of abduction and inductive generalization are integrated enables us to learn such general rules. Experimental results on modelling in this way the effect of Hydrazine in a real metabolic pathway are presented.
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 logic programming. 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 logic programming and abductive logic programming 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.
Ontologies have become an important methodology for representing knowledge, particularly for allowing agents to interchange knowledge over the world-wide-web. From an abstract point of view, an ontology can be seen as...
详细信息
ISBN:
(纸本)354020721X
Ontologies have become an important methodology for representing knowledge, particularly for allowing agents to interchange knowledge over the world-wide-web. From an abstract point of view, an ontology can be seen as a theory about a set of classes. the language underlying the ontology may or may not be decidable;if it is, it is often called a description logic, and the problem of determining whether one description logic formula implies (or subsumes) another is fundamental to deduction in ontologies. this paper models description logics as first-order theories, and employs model-theoretic techniques to determine properties of various description logics. these properties are used to design efficient engines to generate Answer Set Programs that perform deduction in ontologies. this approach contrasts to tableaux theorem proving techniques that are more commonly used. the resulting system serves as an experimental platform to explore the combination of logic-programming based techniques for non-monotonic reasoning and constraint handling with description-logic based deduction. Specifically, we use ASP to create a small but powerful theorem prover for the description logic ALCQI. While ALCQI is P-space complete, our deduction engine requires exponential space in the worst case. However experiments show that its time is roughly comparable to the one of the best tableaux-based engined, DLP [1], even though DLP is written for a simpler description logic, ALCN(1).
A new cross-point, nonvolatile, phase-change memory is investigated. this new memory exploits the properties of the newly discovered controllable threshold voltage for chalcogenide material. Using this unique property...
详细信息
暂无评论