query: How to use prolog rules in a java application
positive_passages.docid: 154104
positive_passages.text: Embedded Prolog Interpreter/Compiler for Java
negative_passages.docid: 37134
negative_passages.text: How can I solve this logic question using propositional logic (Natural deduction)?
negative_passages.docid: 17966
negative_passages.text: Representing the statement using Quantifiers
negative_passages.docid: 90115
negative_passages.text: How can I list the nodes for which a Boolean value is FALSE or NULL?
negative_passages.docid: 92405
negative_passages.text: How to implement a branching wizard?
negative_passages.docid: 119086
negative_passages.text: How to break lines in conditions using algorithm2e?
negative_passages.docid: 132594
negative_passages.text: Is there a better alternative than string manipulation to programmatically build formulas?
negative_passages.docid: 76190
negative_passages.text: pgfmathparse basic usage
negative_passages.docid: 135886
negative_passages.text: How to add input and output before algorithm procedure
negative_passages.docid: 19977
negative_passages.text: Which package can be used to write BNF grammars?
negative_passages.docid: 131761
negative_passages.text: Boolean expressions in Java
negative_passages.docid: 56685
negative_passages.text: Java logical operator short-circuiting
negative_passages.docid: 30296
negative_passages.text: Rule-based labeling in QGIS
negative_passages.docid: 79752
negative_passages.text: Prioritizing pattern rules in Make
negative_passages.docid: 141020
negative_passages.text: Prolog count the number of times a predicate is true
negative_passages.docid: 77189
negative_passages.text: Prolog successor notation yields incomplete result and infinite loop
negative_passages.docid: 131409
negative_passages.text: Prolog fetch element in a sublist