Results 1  10
of
29
Semantic matching: Algorithms and implementation
 JOURNAL ON DATA SEMANTICS
, 2007
"... We view match as an operator that takes two graphlike structures (e.g., classifications, XML schemas) and produces a mapping between the nodes of these graphs that correspond semantically to each other. Semantic matching is based on two ideas: (i) we discover mappings by computing semantic relation ..."
Abstract

Cited by 70 (27 self)
 Add to MetaCart
(Show Context)
We view match as an operator that takes two graphlike structures (e.g., classifications, XML schemas) and produces a mapping between the nodes of these graphs that correspond semantically to each other. Semantic matching is based on two ideas: (i) we discover mappings by computing semantic relations (e.g., equivalence, more general); (ii) we determine semantic relations by analyzing the meaning (concepts, not labels) which is codified in the elements and the structures of schemas. In this paper we present basic and optimized algorithms for semantic matching, and we discuss their implementation within the SMatch system. We evaluate SMatch against three state of the art matching systems, thereby justifying empirically the strength of our approach.
Event calculus reasoning through satisfiability
 Journal of Logic and Computation
, 2004
"... This is a precopyediting, authorproduced PDF of an article accepted for publication in the Journal of Logic and Computation following peer review. The definitive publisherauthenticated version (Mueller, Erik T. (2004). Event calculus reasoning through satisfiability. Journal of Logic and Computa ..."
Abstract

Cited by 36 (8 self)
 Add to MetaCart
(Show Context)
This is a precopyediting, authorproduced PDF of an article accepted for publication in the Journal of Logic and Computation following peer review. The definitive publisherauthenticated version (Mueller, Erik T. (2004). Event calculus reasoning through satisfiability. Journal of Logic and Computation, 14(5), 703–730.) is available online at:
Understanding scriptbased stories using commonsense reasoning
 Cognitive Systems Research
, 2002
"... reasoning, reasoning about action and change This paper investigates the use of commonsense reasoning to understand texts involving stereotypical activities or scripts. We present a system that understands news stories involving four terrorism scripts. The system (1) builds a commonsense reasoning p ..."
Abstract

Cited by 29 (4 self)
 Add to MetaCart
(Show Context)
reasoning, reasoning about action and change This paper investigates the use of commonsense reasoning to understand texts involving stereotypical activities or scripts. We present a system that understands news stories involving four terrorism scripts. The system (1) builds a commonsense reasoning problem given an information extraction template representing a terrorist incident, and (2) uses commonsense reasoning and a commonsense knowledge base to build a model of the terrorist incident. The reasoning problem, commonsense knowledge base, and model are expressed in the classical logic event calculus. The system was developed using the MUC3 and MUC4 development data set. We present the results of running the system on the MUC3 and MUC4 test data sets, using manually generated answer key templates and templates generated automatically by two MUC4 information extraction systems. We present a detailed analysis of the models produced by the system given automatically generated templates. We present methods for answering questions based on the models produced by our system. We assess the portability of the system by extending it to handle 10 scripts frequent in Project Gutenberg American literature texts. 1
Unrestricted vs restricted cut in a tableau method for Boolean circuits
 In: AI&M 2004, 8th International Symposium on Artificial Intelligence and Mathematics
, 2005
"... This paper studies the relative proof complexity of variations of a tableau method for Boolean circuit satisfiability checking obtained by restricting the use of the cut rule in several natural ways. The results show that the unrestricted cut rule can be exponentially more effective than any of th ..."
Abstract

Cited by 23 (4 self)
 Add to MetaCart
(Show Context)
This paper studies the relative proof complexity of variations of a tableau method for Boolean circuit satisfiability checking obtained by restricting the use of the cut rule in several natural ways. The results show that the unrestricted cut rule can be exponentially more effective than any of the considered restrictions. Moreover, there are exponential differences between the restricted versions, too. The results also apply to the DavisPutnam procedure for conjunctive normal form formulae obtained from Boolean circuits with a standard linear size translation.
Improving the Encoding of LTL Model Checking into SAT
, 2002
"... Bounded Model Checking (BMC) is a technique for encoding an LTL model checking problem into a problem of propositional satisfiability. Since the seminal paper by Biere et al. [2], the research on BMC has been primarily directed at achieving higher efficiency for solving reachability properties. In t ..."
Abstract

Cited by 22 (5 self)
 Add to MetaCart
Bounded Model Checking (BMC) is a technique for encoding an LTL model checking problem into a problem of propositional satisfiability. Since the seminal paper by Biere et al. [2], the research on BMC has been primarily directed at achieving higher efficiency for solving reachability properties. In this paper, we tackle the problem of improving BMC encodings for the full class of LTL properties. We start noticing some properties of the encoding of [2], and we exploit them to define improvements that make the resulting boolean formulas smaller or simpler to solve.
Quantifier Trees for QBFs
 In Proc. of the Eighth International Conference on Theory and Applications of Satisfiability Testing (SAT05
, 2005
"... Abstract. We present a method—called quantifier tree reconstruction—that allows to efficiently recover expost a portion of the internal structure of QBF instances which was hidden as a consequence of the cast to prenex normal form. Means to profit from a quantifier tree are presented for all the ma ..."
Abstract

Cited by 20 (1 self)
 Add to MetaCart
(Show Context)
Abstract. We present a method—called quantifier tree reconstruction—that allows to efficiently recover expost a portion of the internal structure of QBF instances which was hidden as a consequence of the cast to prenex normal form. Means to profit from a quantifier tree are presented for all the main families of QBF solvers. Surprising experiments on QBFLIB instances are also reported. 1
Automated reformulation of specifications by safe delay of constraints
 Proceedings of the 2nd International Workshop on Modelling and Reformulating Constraint Satisfaction Problems
, 2003
"... In this paper we propose a form of reasoning on specifications of combinatorial problems, with the goal of reformulating them so that they are more efficiently solvable. The reformulation technique highlights constraints that can be safely “delayed”, and solved afterwards. Our main contribution is t ..."
Abstract

Cited by 19 (8 self)
 Add to MetaCart
In this paper we propose a form of reasoning on specifications of combinatorial problems, with the goal of reformulating them so that they are more efficiently solvable. The reformulation technique highlights constraints that can be safely “delayed”, and solved afterwards. Our main contribution is the characterization (with soundness proof) of safedelay constraints with respect to a criterion on the specification, thus obtaining a mechanism for the automated reformulation of specifications applicable to a great variety of problems, e.g., graph coloring and jobshop scheduling. This is an advancement with respect to the forms of reasoning done by stateoftheartsystems, which typically just detect linearity of specifications. Another contribution is a preliminary experimentation on the effectiveness of the proposed technique, which reveals promising time savings.
Integrating BDDBased and SATBased Symbolic model checking
, 2002
"... Symbolic model checking is a very successful formal verification technique, classically based on Binary Decision Diagrams (BDDs). Recently, ..."
Abstract

Cited by 16 (4 self)
 Add to MetaCart
Symbolic model checking is a very successful formal verification technique, classically based on Binary Decision Diagrams (BDDs). Recently,
Exploiting functional dependencies in declarative problem specifications
 In Proceedings of the Ninth European Conference on Logics in Artificial Intelligence (JELIA 2004
, 2004
"... Abstract. In this paper we tackle the issue of the automatic recognition of functional dependencies among guessed predicates in constraint problem specifications. Functional dependencies arise frequently in pure declarative specifications, because of the intermediate results that need to be computed ..."
Abstract

Cited by 16 (11 self)
 Add to MetaCart
(Show Context)
Abstract. In this paper we tackle the issue of the automatic recognition of functional dependencies among guessed predicates in constraint problem specifications. Functional dependencies arise frequently in pure declarative specifications, because of the intermediate results that need to be computed in order to express some of the constraints, or due to precise modelling choices, e.g., to provide multiple viewpoints of the search space in order to increase propagation. In either way, the recognition of dependencies greatly helps solvers, letting them avoid spending search on unfruitful branches, while maintaining the highest degree of declarativeness. By modelling constraint problem specifications as secondorder formulae, we provide a characterization of functional dependencies in terms of semantic properties of firstorder ones. Additionally, we show how suitable search procedures can be automatically synthesized in order to exploit recognized dependencies. We present opl examples of various problems, from bioinformatics, planning and resource allocation fields, and show how in many cases opl greatly benefits from the addition of such search procedures. 1