2016-06-27 13:09:41 -0500 | commented answer | Solving Logic Problems How can my question be expressed as an ILP problem? |

2016-06-27 12:34:55 -0500 | commented answer | Solving Logic Problems I don't really have a better example. My interest is in solving arbitrary systems of constraints, which I understand is a tall order. I believe the first step is to identify what problem domain a set of constraints belongs to. For example, you can model aerodynamic drag as a function "constrained" by an ODE and boundary conditions. Recognizing that problem class, a solution can be determined symbolically. However, I don't know what problem domain my original question falls into; only that it's presented in some logic that includes arithmetic operations and inequalities. I believe Prolog can handle questions like this, so I hoped that sagemath could too. I also noticed that there's a "sudoku" function which, to me atleast, indicates some kind of satisfiability solving. |

2016-06-27 11:54:17 -0500 | commented answer | Solving Logic Problems The case I present is contrived. What general method can offer solutions for which the set of candidates is "large"? |

2016-06-27 11:46:20 -0500 | received badge | ● Nice Question (source) |

2016-06-27 11:06:30 -0500 | asked a question | Solving Logic Problems A few years ago I asked this question. I have another question along the same lines. Sorry about the <-> notation, I don't know how else to indicate bijection: Can sagemath determine that: |

2016-06-27 10:40:04 -0500 | received badge | ● Notable Question (source) |

2016-06-27 10:40:04 -0500 | received badge | ● Popular Question (source) |

2013-04-28 21:11:55 -0500 | received badge | ● Student (source) |

2013-04-28 07:18:08 -0500 | received badge | ● Scholar (source) |

2013-04-28 07:18:08 -0500 | marked best answer | Solving logic problems |

2013-04-28 07:18:05 -0500 | received badge | ● Supporter (source) |

2013-04-27 08:48:08 -0500 | asked a question | Solving logic problems Given a set of rules, for example: 1. Mary is older than Tom, 2. Tom is older than Sue; Can sage solve the question, "is Mary older than Sue?" More specifically, is Sage able to do what Prolog does - unification of logic problems? Thanks |

Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.