The Experts below are selected from a list of 150 Experts worldwide ranked by ideXlab platform

Eiichi Tanaka - One of the best experts on this subject based on the ideXlab platform.

  • Theoretical aspects of Syntactic pattern recognition
    Pattern Recognition, 1995
    Co-Authors: Eiichi Tanaka
    Abstract:

    Abstract In this paper, a pessimistic view of Syntactic pattern recognition is developed. This paper describes several aspects of Syntactic pattern recognition from various points of view including the relation between the set of patterns and grammars, the semantics of a grammar, the expressive power of a grammar, grammatical inference, comparison between a Syntactic Method and a statistical Method and a comparison of computing costs between a Syntactic Method and a prototype matching Method. In every aspect a Syntactic Method faced with difficulties that are very hard to overcome.

Paqui Lucio - One of the best experts on this subject based on the ideXlab platform.

  • FoIKS - Equational constraint solving via a restricted form of universal quantification
    Lecture Notes in Computer Science, 2006
    Co-Authors: Javier Alvez, Paqui Lucio
    Abstract:

    In this paper, we present a Syntactic Method for solving first-order equational constraints over term algebras. The presented Method exploits a novel notion of quasi-solved form that we call answer. By allowing a restricted form of universal quantification, answers provide a more compact way to represent solutions than the purely existential solved forms found in the literature. Answers have been carefully designed to make satisfiability test feasible and also to allow for boolean operations, while maintaining expressiveness and user-friendliness. We present detailed algorithms for (1) satisfiability checking and for performing the boolean operations of (2) negation of one answer and (3) conjunction of nanswers. Based on these three basic operations, our solver turns any equational constraint into a disjunction of answers. We have implemented a prototype that is available on the web.

  • equational constraint solving via a restricted form of universal quantification
    Lecture Notes in Computer Science, 2006
    Co-Authors: Javier Alvez, Paqui Lucio
    Abstract:

    In this paper, we present a Syntactic Method for solving first-order equational constraints over term algebras. The presented Method exploits a novel notion of quasi-solved form that we call answer. By allowing a restricted form of universal quantification, answers provide a more compact way to represent solutions than the purely existential solved forms found in the literature. Answers have been carefully designed to make satisfiability test feasible and also to allow for boolean operations, while maintaining expressiveness and user-friendliness. We present detailed algorithms for (1) satisfiability checking and for performing the boolean operations of (2) negation of one answer and (3) conjunction of n answers. Based on these three basic operations, our solver turns any equational constraint into a disjunction of answers. We have implemented a prototype that is available on the web.

Javier Alvez - One of the best experts on this subject based on the ideXlab platform.

  • FoIKS - Equational constraint solving via a restricted form of universal quantification
    Lecture Notes in Computer Science, 2006
    Co-Authors: Javier Alvez, Paqui Lucio
    Abstract:

    In this paper, we present a Syntactic Method for solving first-order equational constraints over term algebras. The presented Method exploits a novel notion of quasi-solved form that we call answer. By allowing a restricted form of universal quantification, answers provide a more compact way to represent solutions than the purely existential solved forms found in the literature. Answers have been carefully designed to make satisfiability test feasible and also to allow for boolean operations, while maintaining expressiveness and user-friendliness. We present detailed algorithms for (1) satisfiability checking and for performing the boolean operations of (2) negation of one answer and (3) conjunction of nanswers. Based on these three basic operations, our solver turns any equational constraint into a disjunction of answers. We have implemented a prototype that is available on the web.

  • equational constraint solving via a restricted form of universal quantification
    Lecture Notes in Computer Science, 2006
    Co-Authors: Javier Alvez, Paqui Lucio
    Abstract:

    In this paper, we present a Syntactic Method for solving first-order equational constraints over term algebras. The presented Method exploits a novel notion of quasi-solved form that we call answer. By allowing a restricted form of universal quantification, answers provide a more compact way to represent solutions than the purely existential solved forms found in the literature. Answers have been carefully designed to make satisfiability test feasible and also to allow for boolean operations, while maintaining expressiveness and user-friendliness. We present detailed algorithms for (1) satisfiability checking and for performing the boolean operations of (2) negation of one answer and (3) conjunction of n answers. Based on these three basic operations, our solver turns any equational constraint into a disjunction of answers. We have implemented a prototype that is available on the web.

Wassim Jabi - One of the best experts on this subject based on the ideXlab platform.

Marieke Huisman - One of the best experts on this subject based on the ideXlab platform.

  • CHASE: A static checker for JML's Assignable clause
    Lecture Notes in Computer Science, 2003
    Co-Authors: Néstor Cataño, Marieke Huisman
    Abstract:

    This paper presents a Syntactic Method to check so-called assignable clauses of annotated JAVA programs. Assignable clauses describe which variables may be assigned by a Method. Their correctness is crucial for reasoning about class specifications. The Method that we propose is incomplete, as it only makes a Syntactic check and it does not take aliasing or expression evaluation into account, but it provides efficient means to find the most common errors in assignable clauses. This is demonstrated by applying the Method to the specification of an industrial case study.

  • VMCAI - CHASE: A Static Checker for JML's Assignable Clause
    Lecture Notes in Computer Science, 2002
    Co-Authors: Néstor Cataño, Marieke Huisman
    Abstract:

    This paper presents a Syntactic Method to check so-called assignable clauses of annotated JAVA programs. Assignable clauses describe which variables may be assigned by a Method. Their correctness is crucial for reasoning about class specifications. The Method that we propose is incomplete, as it only makes a Syntactic check and it does not take aliasing or expression evaluation into account, but it provides efficient means to find the most common errors in assignable clauses. This is demonstrated by applying the Method to the specification of an industrial case study.