AMR Logic Converter
Convert Abstract Meaning Representation (AMR) to first-order logic statements.
This library is based on the ideas in the paper "Expressive Power of Abstract Meaning Representations", J. Bos, Computational Linguistics 42(3), 2016. Thank you to @jobos for the paper!
Installation
pip install amr-logic-converter
Usage
This library parses an AMR tree into first-order logic statements. An example of this is shown below:
from amr_logic_converter import AmrLogicConverter
converter = AmrLogicConverter()
AMR = """
(x / boy
:ARG0-of (e / giggle-01
:polarity -))
"""
logic = converter.convert(AMR)
print(logic)
Programmatic logic manipulation
The output from the convert
method can be displayed as a string, but it can also be manipulated in Python. For instance, in the example above, we could also write:
converter = AmrLogicConverter()
AMR = """
(x / boy
:ARG0-of (e / giggle-01
:polarity -))
"""
expr = converter.convert(AMR)
type(expr)
expr.args[0]
Working with alignment markers
This library will parse alignment markers from AMR using the penman library, and will include Alignment objects from penman in Predicate
and Const
objects when available. For example, we can access alignment markers like below:
converter = AmrLogicConverter()
AMR = """
(x / boy~1
:ARG0-of (e / giggle-01~3
:polarity -))
"""
expr = converter.convert(AMR)
expr.args[0].alignment
expr.args[1].body.args[1].alignment
Existentially Quantifying all Instances
In "Expressive Power of Abstract Meaning Representations", all instances are wrapped by an existence quantifier. By default AmrLogicConverter
does not include these as it's likely not useful, but if you'd like to include them as in the paper you can pass the option existentially_quantify_instances=True
when constructing the AmrLogicConverter
as below:
converter = AmrLogicConverter(existentially_quantify_instances=True)
AMR = """
(x / boy
:ARG0-of (e / giggle-01
:polarity -))
"""
logic = converter.convert(AMR)
print(logic)
Coreference Hoisting
When an instance is coreferenced in multiple places in the AMR, it's necessary to hoisting the existential quantification of that variable high enough that it can still wrap all instances of that variable. By default, the existential quantifier will be hoisted to the level of the lowest common ancestor of all nodes in the AMR tree where an instance is coreferenced. However, in "Expressive Power of Abstract Meaning Representations", these coreferences are instead hoisted to the maximal possible scope, wrapping the entire formula. If you want this behavior, you can specify the option maximally_hoist_coreferences=True
when creating the AmrLogicConverter
instance. This is illustrated below:
AMR = """
(b / bad-07
:polarity -
:ARG1 (e / dry-01
:ARG0 (x / person
:named "Mr Krupp")
:ARG1 x))
"""
converter = AmrLogicConverter(
existentially_quantify_instances=True,
)
logic = converter.convert(AMR)
print(logic)
converter = AmrLogicConverter(
existentially_quantify_instances=True,
maximally_hoist_coreferences=True,
)
logic = converter.convert(AMR)
print(logic)
Using Variables for Instances
If you want to use variables for each AMR instance instead of constants, you can pass the option use_variables_for_instances=True
when creating the AmrLogicConverter instance. When existentially_quantify_instances
is set, variable will always be used for instances regardless of this setting.
Misc Options
- By default variables names are capitalized, but you can change this by setting
capitalize_variables=False
. - By default, relations like
:ARG0-of(X, Y)
have their arguments flipped in logic and turned into :ARG0(Y, X)
. If you don't want this normalization to occur, you can disable this by setting invert_relations=False
.
Contributing
Contributions are welcome! Please leave an issue in the Github repo if you find any bugs, and open a pull request with and fixes or improvements that you'd like to contribute. Ideally please include new test cases to verify any changes or bugfixes if appropriate.
This project uses poetry for dependency management and packaging, black for code formatting, flake8 for linting, and mypy for type checking.
License
This project is licenced under a MIT license.
Citation
If you use this software in your work, please cite the following:
@article{chanin2023neuro,
title={Neuro-symbolic Commonsense Social Reasoning},
author={Chanin, David and Hunter, Anthony},
journal={arXiv preprint arXiv:2303.08264},
year={2023}
}