331 lines
9.7 KiB
Rust
331 lines
9.7 KiB
Rust
mod head_type;
|
|
mod translate_body;
|
|
|
|
use head_type::*;
|
|
use translate_body::*;
|
|
use crate::traits::AssignVariableDeclarationDomain as _;
|
|
|
|
struct PredicateDefinitions
|
|
{
|
|
pub parameters: std::rc::Rc<foliage::VariableDeclarations>,
|
|
pub definitions: Vec<crate::ScopedFormula>,
|
|
}
|
|
|
|
type Definitions =
|
|
std::collections::BTreeMap::<std::rc::Rc<foliage::PredicateDeclaration>, PredicateDefinitions>;
|
|
|
|
pub(crate) struct Translator<'p>
|
|
{
|
|
problem: &'p mut crate::Problem,// TODO: refactor
|
|
definitions: Definitions,
|
|
}
|
|
|
|
struct Logger;
|
|
|
|
impl clingo::Logger for Logger
|
|
{
|
|
fn log(&mut self, code: clingo::Warning, message: &str)
|
|
{
|
|
log::warn!("clingo warning ({:?}): {}", code, message);
|
|
}
|
|
}
|
|
|
|
impl<'p> clingo::StatementHandler for Translator<'p>
|
|
{
|
|
fn on_statement(&mut self, statement: &clingo::ast::Statement) -> bool
|
|
{
|
|
match statement.statement_type()
|
|
{
|
|
clingo::ast::StatementType::Rule(ref rule) =>
|
|
{
|
|
if let Err(error) = self.read_rule(rule)
|
|
{
|
|
log::error!("could not translate input program: {}", error);
|
|
return false;
|
|
}
|
|
},
|
|
_ => log::debug!("read statement (other kind)"),
|
|
}
|
|
|
|
true
|
|
}
|
|
}
|
|
|
|
impl<'p> Translator<'p>
|
|
{
|
|
pub fn new(problem: &'p mut crate::Problem) -> Self
|
|
{
|
|
Self
|
|
{
|
|
problem,
|
|
definitions: Definitions::new(),
|
|
}
|
|
}
|
|
|
|
pub fn translate<P>(&mut self, program_path: P) -> Result<(), crate::Error>
|
|
where
|
|
P: AsRef<std::path::Path>
|
|
{
|
|
// Read input program
|
|
let program = std::fs::read_to_string(program_path.as_ref())
|
|
.map_err(
|
|
|error| crate::Error::new_read_file(program_path.as_ref().to_path_buf(), error))?;
|
|
|
|
clingo::parse_program_with_logger(&program, self, &mut Logger, std::u32::MAX)
|
|
.map_err(|error| crate::Error::new_translate(error))?;
|
|
|
|
log::info!("read input program “{}”", program_path.as_ref().display());
|
|
|
|
// TODO: reimplement
|
|
/*
|
|
for (predicate_declaration, predicate_definitions) in self.definitions.iter()
|
|
{
|
|
for definition in predicate_definitions.definitions.iter()
|
|
{
|
|
log::debug!("definition({}/{}): {}.", predicate_declaration.name,
|
|
predicate_declaration.arity,
|
|
foliage::format::display_formula(&definition.formula, self.problem));
|
|
}
|
|
}*/
|
|
|
|
let completed_definition = |predicate_declaration, definitions: &mut Definitions,
|
|
problem: &crate::Problem|
|
|
{
|
|
match definitions.remove(predicate_declaration)
|
|
{
|
|
// This predicate symbol has at least one definition, so build the disjunction of those
|
|
Some(predicate_definitions) =>
|
|
{
|
|
let or_arguments = predicate_definitions.definitions.into_iter()
|
|
.map(|x| crate::existential_closure(x))
|
|
.collect::<Vec<_>>();
|
|
let or = foliage::Formula::or(or_arguments);
|
|
|
|
let head_arguments = predicate_definitions.parameters.iter()
|
|
.map(|x| foliage::Term::variable(std::rc::Rc::clone(x)))
|
|
.collect::<Vec<_>>();
|
|
|
|
let head_predicate = foliage::Formula::predicate(
|
|
std::rc::Rc::clone(predicate_declaration), head_arguments);
|
|
|
|
let completed_definition =
|
|
foliage::Formula::if_and_only_if(vec![head_predicate, or]);
|
|
|
|
let scoped_formula = crate::ScopedFormula
|
|
{
|
|
free_variable_declarations: predicate_definitions.parameters,
|
|
formula: completed_definition,
|
|
};
|
|
|
|
crate::universal_closure(scoped_formula)
|
|
},
|
|
// This predicate has no definitions, so universally falsify it
|
|
None =>
|
|
{
|
|
let parameters = std::rc::Rc::new((0..predicate_declaration.arity)
|
|
.map(|_|
|
|
{
|
|
let variable_declaration = std::rc::Rc::new(
|
|
foliage::VariableDeclaration::new("<anonymous>".to_string()));
|
|
problem.assign_variable_declaration_domain(&variable_declaration,
|
|
crate::Domain::Program);
|
|
variable_declaration
|
|
})
|
|
.collect::<Vec<_>>());
|
|
|
|
let head_arguments = parameters.iter()
|
|
.map(|x| foliage::Term::variable(std::rc::Rc::clone(x)))
|
|
.collect();
|
|
|
|
let head_predicate = foliage::Formula::predicate(
|
|
std::rc::Rc::clone(predicate_declaration), head_arguments);
|
|
|
|
let not = foliage::Formula::not(Box::new(head_predicate));
|
|
|
|
let scoped_formula = crate::ScopedFormula
|
|
{
|
|
free_variable_declarations: parameters,
|
|
formula: not,
|
|
};
|
|
|
|
crate::universal_closure(scoped_formula)
|
|
},
|
|
}
|
|
};
|
|
|
|
for predicate_declaration in self.problem.predicate_declarations.borrow().iter()
|
|
{
|
|
let completed_definition =
|
|
completed_definition(predicate_declaration, &mut self.definitions, self.problem);
|
|
|
|
let statement = crate::problem::Statement::new(
|
|
crate::problem::StatementKind::Assumption, completed_definition)
|
|
.with_name(format!("completed_definition_{}_{}", predicate_declaration.name,
|
|
predicate_declaration.arity))
|
|
.with_description(format!("completed definition of {}/{}",
|
|
predicate_declaration.name, predicate_declaration.arity));
|
|
|
|
self.problem.add_statement(crate::problem::SectionKind::CompletedDefinitions,
|
|
statement);
|
|
}
|
|
|
|
Ok(())
|
|
}
|
|
|
|
fn read_rule(&mut self, rule: &clingo::ast::Rule)
|
|
-> Result<(), crate::Error>
|
|
{
|
|
let head_type = determine_head_type(rule.head(), self.problem)?;
|
|
|
|
match &head_type
|
|
{
|
|
HeadType::SingleAtom(head_atom)
|
|
| HeadType::ChoiceWithSingleAtom(head_atom) =>
|
|
{
|
|
if !self.definitions.contains_key(&head_atom.predicate_declaration)
|
|
{
|
|
let parameters = std::rc::Rc::new((0..head_atom.predicate_declaration.arity)
|
|
.map(|_|
|
|
{
|
|
let variable_declaration = std::rc::Rc::new(
|
|
foliage::VariableDeclaration::new("<anonymous>".to_string()));
|
|
self.problem.assign_variable_declaration_domain(&variable_declaration,
|
|
crate::Domain::Program);
|
|
variable_declaration
|
|
})
|
|
.collect());
|
|
|
|
self.definitions.insert(
|
|
std::rc::Rc::clone(&head_atom.predicate_declaration),
|
|
PredicateDefinitions
|
|
{
|
|
parameters,
|
|
definitions: vec![],
|
|
});
|
|
}
|
|
|
|
// TODO: refactor
|
|
let predicate_definitions =
|
|
self.definitions.get_mut(&head_atom.predicate_declaration).unwrap();
|
|
|
|
let parameters = std::rc::Rc::clone(&predicate_definitions.parameters);
|
|
let free_variable_declarations = std::cell::RefCell::new(vec![]);
|
|
let free_layer =
|
|
foliage::VariableDeclarationStackLayer::Free(free_variable_declarations);
|
|
let parameters_layer =
|
|
foliage::VariableDeclarationStackLayer::bound(&free_layer, parameters);
|
|
|
|
let mut definition_arguments =
|
|
translate_body(rule.body(), self.problem, ¶meters_layer)?;
|
|
|
|
// TODO: refactor
|
|
assert_eq!(predicate_definitions.parameters.len(), head_atom.arguments.len());
|
|
|
|
if let HeadType::ChoiceWithSingleAtom(_) = head_type
|
|
{
|
|
let head_arguments = predicate_definitions.parameters.iter()
|
|
.map(|x| foliage::Term::variable(std::rc::Rc::clone(x)))
|
|
.collect::<Vec<_>>();
|
|
|
|
let head_predicate = foliage::Formula::predicate(
|
|
std::rc::Rc::clone(&head_atom.predicate_declaration), head_arguments);
|
|
|
|
definition_arguments.push(head_predicate);
|
|
}
|
|
|
|
let mut head_atom_arguments_iterator = head_atom.arguments.iter();
|
|
|
|
for parameter in predicate_definitions.parameters.iter()
|
|
{
|
|
let head_atom_argument = head_atom_arguments_iterator.next().unwrap();
|
|
|
|
let translated_head_term = crate::translate::common::choose_value_in_term(
|
|
head_atom_argument, std::rc::Rc::clone(parameter), self.problem,
|
|
¶meters_layer)?;
|
|
|
|
definition_arguments.push(translated_head_term);
|
|
}
|
|
|
|
// TODO: refactor
|
|
let free_variable_declarations = match free_layer
|
|
{
|
|
foliage::VariableDeclarationStackLayer::Free(free_variable_declarations)
|
|
=> free_variable_declarations.into_inner(),
|
|
_ => unreachable!(),
|
|
};
|
|
|
|
let definition = match definition_arguments.len()
|
|
{
|
|
1 => definition_arguments.pop().unwrap(),
|
|
0 => foliage::Formula::true_(),
|
|
_ => foliage::Formula::and(definition_arguments),
|
|
};
|
|
|
|
let definition = crate::ScopedFormula
|
|
{
|
|
free_variable_declarations: std::rc::Rc::new(free_variable_declarations),
|
|
formula: definition,
|
|
};
|
|
|
|
// TODO: refactor
|
|
// TODO: reimplement
|
|
/*
|
|
log::debug!("translated rule with single atom in head: {}",
|
|
foliage::format::display_formula(&definition.formula, self.problem));
|
|
*/
|
|
|
|
predicate_definitions.definitions.push(definition);
|
|
},
|
|
HeadType::IntegrityConstraint =>
|
|
{
|
|
let free_variable_declarations = std::cell::RefCell::new(vec![]);
|
|
let free_layer =
|
|
foliage::VariableDeclarationStackLayer::Free(free_variable_declarations);
|
|
|
|
let mut arguments = translate_body(rule.body(), self.problem, &free_layer)?;
|
|
|
|
// TODO: refactor
|
|
let free_variable_declarations = match free_layer
|
|
{
|
|
foliage::VariableDeclarationStackLayer::Free(free_variable_declarations)
|
|
=> free_variable_declarations.into_inner(),
|
|
_ => unreachable!(),
|
|
};
|
|
|
|
let formula = match arguments.len()
|
|
{
|
|
1 => foliage::Formula::not(Box::new(arguments.pop().unwrap())),
|
|
0 => foliage::Formula::false_(),
|
|
_ => foliage::Formula::not(Box::new(foliage::Formula::and(arguments))),
|
|
};
|
|
|
|
let scoped_formula = crate::ScopedFormula
|
|
{
|
|
free_variable_declarations: std::rc::Rc::new(free_variable_declarations),
|
|
formula,
|
|
};
|
|
|
|
let integrity_constraint = crate::universal_closure(scoped_formula);
|
|
|
|
// TODO: refactor
|
|
// TODO: reimplement
|
|
/*
|
|
log::debug!("translated integrity constraint: {}",
|
|
foliage::format::display_formula(&integrity_constraint, self.problem));
|
|
*/
|
|
|
|
let statement = crate::problem::Statement::new(
|
|
crate::problem::StatementKind::Assumption, integrity_constraint)
|
|
.with_name("integrity_constraint".to_string())
|
|
.with_description("integrity constraint".to_string());
|
|
|
|
self.problem.add_statement(crate::problem::SectionKind::IntegrityConstraints,
|
|
statement);
|
|
},
|
|
HeadType::Trivial => log::info!("skipping trivial rule"),
|
|
}
|
|
|
|
Ok(())
|
|
}
|
|
}
|