The British Nationality Act as a logic program
Communications of the ACM
Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
A declarative approach to business rules in contracts: courteous logic programs in XML
Proceedings of the 1st ACM conference on Electronic commerce
Formal Specification of Security Requirements using the Theory of Normative Positions
ESORICS '92 Proceedings of the Second European Symposium on Research in Computer Security
Expanding the scope of the ATIS task: the ATIS-3 corpus
HLT '94 Proceedings of the workshop on Human Language Technology
Privacy and Contextual Integrity: Framework and Applications
SP '06 Proceedings of the 2006 IEEE Symposium on Security and Privacy
Compliance checking between business processes and business contracts
EDOC '06 Proceedings of the 10th IEEE International Enterprise Distributed Object Computing Conference
Wide-coverage semantic representations from a CCG parser
COLING '04 Proceedings of the 20th international conference on Computational Linguistics
Journal of Artificial Intelligence Research
Learning context-dependent mappings from sentences to logical form
ACL '09 Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP: Volume 2 - Volume 2
Quantifier scope disambiguation using extracted pragmatic knowledge: preliminary results
EMNLP '09 Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing: Volume 3 - Volume 3
A security policy model for clinical information systems
SP'96 Proceedings of the 1996 IEEE conference on Security and privacy
Regulatory conformance checking: logic and logical form
Regulatory conformance checking: logic and logical form
| Hi-index | 0.00 |
The computation of logical form has been proposed as an intermediate step in the translation of sentences to logic. Logical form encodes the resolution of scope ambiguities. In this paper, we describe experiments on a modest-sized corpus of regulation annotated with a novel variant of logical form, called abstract syntax trees (ASTs). The main step in computing ASTs is to order scope-taking operators. A learning model for ranking is adapted fortius ordering. We design features by studying the problem of comparing the scope of one operator to another. The scope comparisons are used to compute ASTs, with an F-score of 90.6% on the set of ordering decisons.