TweetyProject

A comprehensive collection of Java libraries for logical aspects of artificial intelligence and knowledge representation

Brought to you by

Supported by

back

Example code and resources

Most libraries have an examples package that contains various example code snippets that show the functionality of the library. In addition, the resources folder contains examplary instance files that can be parsed by the corresponding parser into the classes of the library.

Below is an up-to-date list of available examples and instance files.

• General Libraries
  • Command Line Interface (org.tweetyproject.cli)
  • Commons (org.tweetyproject.commons)
  • Comparator Library (org.tweetyproject.comparator)
  • Graph Library (org.tweetyproject.graphs)
  • Math (org.tweetyproject.math)
  • Plugin Project (org.tweetyproject.plugin)
• Logic Libraries
  • Business Process Modelling (org.tweetyproject.logics.bpm)
  • Conditional Logic (org.tweetyproject.logics.cl)
  • Commons Logic (org.tweetyproject.logics.commons)
  • Description Logics (org.tweetyproject.logics.dl)
  • First-Order-Logic (org.tweetyproject.logics.fol)
  • Modal Logic Library (org.tweetyproject.logics.ml)
  • Markov Logic Networks Library (org.tweetyproject.logics.mln)
  • Probabilistic Conditional Logic Library (org.tweetyproject.logics.pcl)
  • Petri Nets Library (org.tweetyproject.logics.petri)
  • Propositional Logic (org.tweetyproject.logics.pl)
  • Quantified Boolean Formulas (org.tweetyproject.logics.qbf)
  • Relational Conditional Logic Library (org.tweetyproject.logics.rcl)
  • Reiter's Default Logic Library (org.tweetyproject.logics.rdl)
  • Relational Probabilistic Conditional Logic Library (org.tweetyproject.logics.rpcl)
  • Translators Library (org.tweetyproject.logics.translators)
• Logic Programming Libraries
  • ASP Library (org.tweetyproject.lp.asp)
  • ASP Belief Dynamics (org.tweetyproject.lp.asp.beliefdynamics)
  • Nested Logic Programs (org.tweetyproject.lp.nlp)
• Argumentation Libraries
  • ABA Library (org.tweetyproject.arg.aba)
  • ADF Library (org.tweetyproject.arg.adf)
  • ASPIC Library (org.tweetyproject.arg.aspic)
  • Bipolar Argumentation Library (org.tweetyproject.arg.bipolar)
  • Deductive Argumentation Library (org.tweetyproject.arg.deductive)
  • Defeasible Logic Programming Library (org.tweetyproject.arg.delp)
  • Dung Argumentation Library (org.tweetyproject.arg.dung)
  • Logic Programming Argumentation Library (org.tweetyproject.arg.lp)
  • Probabilistic Argumentation Library (org.tweetyproject.arg.prob)
  • Ranking Semantics for Argumentation Library (org.tweetyproject.arg.rankings)
  • Structured Argumentation Frameworks Library (org.tweetyproject.arg.saf)
  • SetAFs (org.tweetyproject.arg.setaf)
  • Social Abstract Argumentation Library (org.tweetyproject.arg.social)
• Agent Libraries
  • Agents Library (org.tweetyproject.agents)
  • Dialogue Systems Library (org.tweetyproject.agents.dialogues)
• Other Libraries
  • Action and Change (org.tweetyproject.action)
  • Belief Dynamics Library (org.tweetyproject.beliefdynamics)
  • Machine Learning Library (org.tweetyproject.machinelearning)
  • Preferences Library (org.tweetyproject.preferences)
  • SAT Library (org.tweetyproject.sat)
  • Web Services (org.tweetyproject.web)

---

General Libraries

Command Line Interface (org.tweetyproject.cli)

Example code:

no example code available

Resources:

no resources available

Commons (org.tweetyproject.commons)

Example code:

• examples.SubsetIteratorExample.java: Class SubsetIteratorExample
• examples.SubsetIteratorExample.java: Class SubsetIteratorExample

Resources:

no resources available

Comparator Library (org.tweetyproject.comparator)

Example code:

no example code available

Resources:

no resources available

Graph Library (org.tweetyproject.graphs)

Example code:

• examples.GraphExample.java: Example that shows how to construct graphs programmatically.
• examples.GraphExample2.java: Another example that shows how to construct graphs programmatically.
• examples.HyperGraphExample.java: example for a hypergraph
• examples.GraphExample.java: Example that shows how to construct graphs programmatically.
• examples.GraphExample2.java: Another example that shows how to construct graphs programmatically.
• examples.HyperGraphExample.java: example for a hypergraph

Resources:

no resources available

Math (org.tweetyproject.math)

Example code:

• examples.ApacheCommonsCMAESOptimizerEx.java: This class implements an example for the ApacheCommonsCMAESOptimizer
• examples.ApacheCommonsNonLinearConjugateGradientOptimizerEx.java: This class implements an example for the ApacheCommonsNonLinearConjugateGradientOptimizer
• examples.ApacheCommonsSimplexEx.java: This class implements an example for the Apache Commons SimplexSolver. Version used is 2.0
• examples.ApacheCommonsSimplexEx2.java: This class is a second example for the ApacheCommonsSimplexSolver. It showcases some more features of the library. Not all steps are particularly necessary for the result. But they are fun though.
• examples.BfgsSolverEx.java: This class implements an example for the BfgsSolver
• examples.GlpkSolverEx.java: This class implements an example for the Glpk Solver
• examples.GradientDescentSolverEx.java: This class implements an example for the Gradient Descent Solver
• examples.GurobiTest.java: test for gurobi
• examples.HessianGradientSolverEx.java: This class implements an example for the Hessian Gradient Solver
• examples.IteratedLocalSearchOnConstrProbEx.java: This class implements an example for Tabu search. It is natively implemented
• examples.KnapSack.java: This class implements a KnapSack problem
• examples.KnapSack_solvedWithGeneticOpt.java: example for KnapSack via GenOpt
• examples.KnapSack_solvedWithIteratedLocalSearch2.java: Class implementing an example for a TSP on a cartesian fully connected graph
• examples.KnapSack_solvedWithSimAn.java: example for KnaSack via SimAn
• examples.KnapSack_solvedWithTabuSearch.java: example of KnapSack via Tabu Search
• examples.Knapsack_solvedWithStochasticLocalSearch.java: Class implementing an example for a TSP on a cartesian fully connected graph
• examples.LagrangeSolverEx.java: This class implements an example for the Lagrange Solver. It is natively implemented.
• examples.LagrangeSolverEx2.java: This class implements an example for a problem solved by the lagrange solver. It is meant to showcase more classes of the library.
• examples.LpSolverEx.java: This class implements an example for the Genetic LpSolver. It uses LpSolve Version 5.5.2.5 (https://sourceforge.net/projects/lpsolve/)
• examples.OctaveSqpSolverEx.java: This class implements an example for the OctaveSqpSolver. Version used is 5.2.0
• examples.SimpleGeneticOptimizationSolverEx.java: This class implements an example for the Genetic Optimization Solver. It is natively implemented
• examples.SimulatedAnnealingOnConstrProbEx2.java: This class implements an example for Simulated Annealing on optimization problems. It is natively implemented
• examples.StochasticLocalSearchOnConstrProbEx.java: This class implements an example for Simulated Annealing on optimization problems. It is natively implemented
• examples.TabuSearchOnConstrProbEx.java: This class implements an example for Tabu search. It is natively implemented
• examples.TestToQuadraticForm.java: testing the function to model a quadratic function to quadratic form
• examples.TravelingSalesman.java: implements the traveling salesman problem. Every element has an x- coordinate and a y- coordinate. Every city can be connected to each other and the distance is the cartesian distance bewteen them. Therefore the graph is fully connected.
• examples.TravelingSalesmanEx2.java: Class implementing an example for a TSP on a cartesian fully connected graph
• examples.TravelingSalesman_solvedWithAntOpt.java: This class implements an example for the ant colony algorithm using isula for combinatrics problems
• examples.TravelingSalesman_solvedWithGeneticOpt.java: Class implementing an example for a TSP on a cartesian fully connected graph
• examples.TravelingSalesman_solvedWithIteratedLocalSearch.java: Class implementing an example for a TSP on a cartesian fully connected graph
• examples.TravelingSalesman_solvedWithSimAn.java: Class implementing an example for a TSP on a cartesian fully connected graph
• examples.TravelingSalesman_solvedWithStochasticLocalSearch.java: Class implementing an example for a TSP on a cartesian fully connected graph
• examples.TravelingSalesman_solvedWithTabuSearch.java: Class implementing an example for a TSP on a cartesian fully connected graph
• examples.ApacheCommonsCMAESOptimizerEx.java: This class implements an example for the ApacheCommonsCMAESOptimizer
• examples.ApacheCommonsNonLinearConjugateGradientOptimizerEx.java: This class implements an example for the ApacheCommonsNonLinearConjugateGradientOptimizer
• examples.ApacheCommonsSimplexEx.java: This class implements an example for the Apache Commons SimplexSolver. Version used is 2.0
• examples.ApacheCommonsSimplexEx2.java: This class is a second example for the ApacheCommonsSimplexSolver. It showcases some more features of the library. Not all steps are particularly necessary for the result. But they are fun though.
• examples.BfgsSolverEx.java: This class implements an example for the BfgsSolver
• examples.GlpkSolverEx.java: This class implements an example for the Glpk Solver
• examples.GradientDescentSolverEx.java: This class implements an example for the Gradient Descent Solver
• examples.GurobiTest.java: test for gurobi
• examples.HessianGradientSolverEx.java: This class implements an example for the Hessian Gradient Solver
• examples.IteratedLocalSearchOnConstrProbEx.java: This class implements an example for Tabu search. It is natively implemented
• examples.KnapSack.java: This class implements a KnapSack problem
• examples.KnapSack_solvedWithGeneticOpt.java: example for KnapSack via GenOpt
• examples.KnapSack_solvedWithIteratedLocalSearch2.java: Class implementing an example for a TSP on a cartesian fully connected graph
• examples.KnapSack_solvedWithSimAn.java: example for KnaSack via SimAn
• examples.KnapSack_solvedWithTabuSearch.java: example of KnapSack via Tabu Search
• examples.Knapsack_solvedWithStochasticLocalSearch.java: Class implementing an example for a TSP on a cartesian fully connected graph
• examples.LagrangeSolverEx.java: This class implements an example for the Lagrange Solver. It is natively implemented.
• examples.LagrangeSolverEx2.java: This class implements an example for a problem solved by the lagrange solver. It is meant to showcase more classes of the library.
• examples.LpSolverEx.java: This class implements an example for the Genetic LpSolver. It uses LpSolve Version 5.5.2.5 (https://sourceforge.net/projects/lpsolve/)
• examples.OctaveSqpSolverEx.java: This class implements an example for the OctaveSqpSolver. Version used is 5.2.0
• examples.SimpleGeneticOptimizationSolverEx.java: This class implements an example for the Genetic Optimization Solver. It is natively implemented
• examples.SimulatedAnnealingOnConstrProbEx2.java: This class implements an example for Simulated Annealing on optimization problems. It is natively implemented
• examples.StochasticLocalSearchOnConstrProbEx.java: This class implements an example for Simulated Annealing on optimization problems. It is natively implemented
• examples.TabuSearchOnConstrProbEx.java: This class implements an example for Tabu search. It is natively implemented
• examples.TestToQuadraticForm.java: testing the function to model a quadratic function to quadratic form
• examples.TravelingSalesman.java: implements the traveling salesman problem. Every element has an x- coordinate and a y- coordinate. Every city can be connected to each other and the distance is the cartesian distance bewteen them. Therefore the graph is fully connected.
• examples.TravelingSalesmanEx2.java: Class implementing an example for a TSP on a cartesian fully connected graph
• examples.TravelingSalesman_solvedWithAntOpt.java: This class implements an example for the ant colony algorithm using isula for combinatrics problems
• examples.TravelingSalesman_solvedWithGeneticOpt.java: Class implementing an example for a TSP on a cartesian fully connected graph
• examples.TravelingSalesman_solvedWithIteratedLocalSearch.java: Class implementing an example for a TSP on a cartesian fully connected graph
• examples.TravelingSalesman_solvedWithSimAn.java: Class implementing an example for a TSP on a cartesian fully connected graph
• examples.TravelingSalesman_solvedWithStochasticLocalSearch.java: Class implementing an example for a TSP on a cartesian fully connected graph
• examples.TravelingSalesman_solvedWithTabuSearch.java: Class implementing an example for a TSP on a cartesian fully connected graph

Resources:

no resources available

Plugin Project (org.tweetyproject.plugin)

Example code:

no example code available

Resources:

no resources available

---

Logic Libraries

Business Process Modelling (org.tweetyproject.logics.bpm)

Example code:

• examples.Example.java: Visualize inconsistency analysis for some BPMN models
• examples.Example.java: Visualize inconsistency analysis for some BPMN models

Resources:

• resources.problematic_basketball.bpmn
• resources.problematic_hit.bpmn
• resources.problematic_with_inclusive_gateways.bpmn
• resources.unproblematic_browsing.bpmn
• resources.unproblematic_dinner.bpmn
• resources.problematic_basketball.bpmn
• resources.problematic_hit.bpmn
• resources.problematic_with_inclusive_gateways.bpmn
• resources.unproblematic_browsing.bpmn
• resources.unproblematic_dinner.bpmn

Conditional Logic (org.tweetyproject.logics.cl)

Example code:

• examples.CReasonerExample.java: Shows how to construct a conditional logic knowledge base programmatically and how to query it using the C-reasoner.
• examples.ReasonerExample.java: Compares reasoning with different reasoners.
• examples.CReasonerExample.java: Shows how to construct a conditional logic knowledge base programmatically and how to query it using the C-reasoner.
• examples.ReasonerExample.java: Compares reasoning with different reasoners.

Resources:

• resources.adf_to_ocf_example.txt
• resources.adf_to_ocf_example.txt

Commons Logic (org.tweetyproject.logics.commons)

Example code:

no example code available

Resources:

no resources available

Description Logics (org.tweetyproject.logics.dl)

Example code:

• examples.DlExample.java: Examples for using the description logic syntax classes and parser.
• examples.DlExample.java: Examples for using the description logic syntax classes and parser.

Resources:

• resources.examplebeliefbase.dlogic
• resources.examplebeliefbase2.dlogic
• resources.examplebeliefbase.dlogic
• resources.examplebeliefbase2.dlogic

First-Order-Logic (org.tweetyproject.logics.fol)

Example code:

• examples.FolExample.java: Some examples for using FolParser and provers.
• examples.StandardFolWriterExample.java: Shows how to use the StandardFolWriter.
• examples.TPTPParserExample.java: Examples for using TPTPParser.
• examples.FolExample.java: Some examples for using FolParser and provers.
• examples.StandardFolWriterExample.java: Shows how to use the StandardFolWriter.
• examples.TPTPParserExample.java: Examples for using TPTPParser.

Resources:

• resources.examplebeliefbase.fologic
• resources.examplebeliefbase2.fologic
• resources.tptpexample.fologic
• resources.tptpexample2.fologic
• resources.tptpexample3.fologic
• resources.examplebeliefbase.fologic
• resources.examplebeliefbase2.fologic
• resources.tptpexample.fologic
• resources.tptpexample2.fologic
• resources.tptpexample3.fologic

Modal Logic Library (org.tweetyproject.logics.ml)

Example code:

• examples.MlExample.java: Some examples for testing ModalParser and NaiveModalReasoner. Shows how to construct a modal logic knowledge base programmatically and how to query it using the naive reasoner.
• examples.MlExample2.java: More examples for testing ModalParser and ModalReasoner. Shows how to construct a modal logic knowledge base programmatically and how to query it using the SPASS reasoner.
• examples.MlExample.java: Some examples for testing ModalParser and NaiveModalReasoner. Shows how to construct a modal logic knowledge base programmatically and how to query it using the naive reasoner.
• examples.MlExample2.java: More examples for testing ModalParser and ModalReasoner. Shows how to construct a modal logic knowledge base programmatically and how to query it using the SPASS reasoner.

Resources:

• resources.examplebeliefbase.mlogic
• resources.examplebeliefbase2.mlogic
• resources.examplebeliefbase.mlogic
• resources.examplebeliefbase2.mlogic

Markov Logic Networks Library (org.tweetyproject.logics.mln)

Example code:

• examples.AlchemyExample.java: Example code illustrating the use of the Alchemy reasoner.
• examples.ApproximationExample.java: Example code illustrating the use of the sampling-based MLN reasoner.
• examples.MlnExample.java: Shows how MLNs can be constructed programmatically and shows how coherence measures can be used.
• examples.MlnExample2.java: Gives further examples on how MLNs can be constructed programmatically and how coherence measures can be used.
• examples.AlchemyExample.java: Example code illustrating the use of the Alchemy reasoner.
• examples.ApproximationExample.java: Example code illustrating the use of the sampling-based MLN reasoner.
• examples.MlnExample.java: Shows how MLNs can be constructed programmatically and shows how coherence measures can be used.
• examples.MlnExample2.java: Gives further examples on how MLNs can be constructed programmatically and how coherence measures can be used.

Resources:

no resources available

Probabilistic Conditional Logic Library (org.tweetyproject.logics.pcl)

Example code:

• examples.AnalysisExample.java: Example code illustrating the use of inconsistency measures and repairing approaches.
• examples.MaxEntExample.java: Implementation of example Grippe (flu) from lecture Commonsense Reasoning in summer term 2020, chapter 4, slide 204
• examples.RepairExample.java: Example code illustrating the use of repairing approaches.
• examples.AnalysisExample.java: Example code illustrating the use of inconsistency measures and repairing approaches.
• examples.MaxEntExample.java: Implementation of example Grippe (flu) from lecture Commonsense Reasoning in summer term 2020, chapter 4, slide 204
• examples.RepairExample.java: Example code illustrating the use of repairing approaches.

Resources:

no resources available

Petri Nets Library (org.tweetyproject.logics.petri)

Example code:

no example code available

Resources:

no resources available

Propositional Logic (org.tweetyproject.logics.pl)

Example code:

• examples.ContensionExample.java: Example code illustrating the contension inconsistency measure.
• examples.DSumMeasureExample.java: Example code illustrating the distance-based inconsistency measures DSum, DMax and DHit.
• examples.DfInconsistencyMeasureExample.java: Example code illustrating the Df inconsistency measure.
• examples.FuzzyMeasureExample.java: Example code illustrating fuzzy logic-based inconsistency measures.
• examples.IcebergInconsistencyExample.java: Example code for the "iceberg" inconsistency measures as described in [De Bona, Hunter. Localising iceberg inconsistencies. AI 2017].
• examples.ImPostulateEvaluationExample.java: Example code illustrating automatic postulate evaluation of inconsistency measures.
• examples.InconsistencyMeasureEvaluationExample.java: Example code for using InconsistencyMeasureEvaluator for comparing inconsistency measure implementations.
• examples.MaMeasureExample.java: Example code illustrating the Ma inconsistency measure.
• examples.MaxSatExample.java: Illustrates the use of MaxSAT solvers.
• examples.McscInconsistencyMeasureExample.java: Example code illustrating the MCSC inconsistency measure.
• examples.MinimalInconsistentSubsetExample.java: Example code illustrating the use of MUS enumerators.
• examples.MusExample.java: Example code illustrating the use of MUS enumerators.
• examples.PlExample.java: Some general examples for using basic propositional logic classes like PlParser and SimplePlReasoner.
• examples.PmMeasureExample.java: Example code illustrating the Pm inconsistency measure.
• examples.PrimeImplicantTest.java
• examples.SatSolverExample.java: Example code illustrating the use of external SAT solvers such as Lingeling and CaDicaL, and related utilities. Most other modern SAT solvers that use the Dimacs format can be used the same way as the solvers in this example by providing the path to the solver's binary.
  Note: You need to download the respective solvers and replace the paths to their binaries in the example, otherwise it won't run. See
• examples.SimplePlInterpolantEnumeratorExample.java: Illustrates the use of the SimplePlInterpolantEnumerator
• examples.StreamInconsistencyEvaluationExample.java: Illustrates stream-based inconsistency measurement.
• examples.StreamInconsistencyEvaluationExample2.java: Illustrates stream-based inconsistency measurement.
• examples.SyntacticEnumeratingPlBeliefSetSamplerExample.java: Illustrates the use of the belief base enumerators.
• examples.SyntacticRandomPlBeliefSetSamplerExample.java: Illustrates the use of the belief base enumerators.
• examples.ContensionExample.java: Example code illustrating the contension inconsistency measure.
• examples.DSumMeasureExample.java: Example code illustrating the distance-based inconsistency measures DSum, DMax and DHit.
• examples.DfInconsistencyMeasureExample.java: Example code illustrating the Df inconsistency measure.
• examples.FuzzyMeasureExample.java: Example code illustrating fuzzy logic-based inconsistency measures.
• examples.IcebergInconsistencyExample.java: Example code for the "iceberg" inconsistency measures as described in [De Bona, Hunter. Localising iceberg inconsistencies. AI 2017].
• examples.ImPostulateEvaluationExample.java: Example code illustrating automatic postulate evaluation of inconsistency measures.
• examples.InconsistencyMeasureEvaluationExample.java: Example code for using InconsistencyMeasureEvaluator for comparing inconsistency measure implementations.
• examples.MaMeasureExample.java: Example code illustrating the Ma inconsistency measure.
• examples.MaxSatExample.java: Illustrates the use of MaxSAT solvers.
• examples.McscInconsistencyMeasureExample.java: Example code illustrating the MCSC inconsistency measure.
• examples.MinimalInconsistentSubsetExample.java: Example code illustrating the use of MUS enumerators.
• examples.MusExample.java: Example code illustrating the use of MUS enumerators.
• examples.PlExample.java: Some general examples for using basic propositional logic classes like PlParser and SimplePlReasoner.
• examples.PmMeasureExample.java: Example code illustrating the Pm inconsistency measure.
• examples.PrimeImplicantTest.java
• examples.SatSolverExample.java: Example code illustrating the use of external SAT solvers such as Lingeling and CaDicaL, and related utilities. Most other modern SAT solvers that use the Dimacs format can be used the same way as the solvers in this example by providing the path to the solver's binary.
  Note: You need to download the respective solvers and replace the paths to their binaries in the example, otherwise it won't run. See
• examples.SimplePlInterpolantEnumeratorExample.java: Illustrates the use of the SimplePlInterpolantEnumerator
• examples.StreamInconsistencyEvaluationExample.java: Illustrates stream-based inconsistency measurement.
• examples.StreamInconsistencyEvaluationExample2.java: Illustrates stream-based inconsistency measurement.
• examples.SyntacticEnumeratingPlBeliefSetSamplerExample.java: Illustrates the use of the belief base enumerators.
• examples.SyntacticRandomPlBeliefSetSamplerExample.java: Illustrates the use of the belief base enumerators.

Resources:

• resources.CanonicalKBs188900.txt
• resources.dimacs_ex1.cnf
• resources.dimacs_ex2.cnf
• resources.dimacs_ex3.cnf
• resources.dimacs_ex4.cnf
• resources.dimacs_ex5.cnf
• resources.examplebeliefbase.proplogic
• resources.examplebeliefbase_multiple.proplogic
• resources.examplebeliefbase_xor.proplogic
• resources.CanonicalKBs188900.txt
• resources.dimacs_ex1.cnf
• resources.dimacs_ex2.cnf
• resources.dimacs_ex3.cnf
• resources.dimacs_ex4.cnf
• resources.dimacs_ex5.cnf
• resources.examplebeliefbase.proplogic
• resources.examplebeliefbase_multiple.proplogic
• resources.examplebeliefbase_xor.proplogic

Quantified Boolean Formulas (org.tweetyproject.logics.qbf)

Example code:

• examples.QbfExample.java: Some general examples for quantified boolean formulas and for parsers and writers.
• examples.QbfReasonersExample.java: Examples for using QBF solvers.
• examples.QbfExample.java: Some general examples for quantified boolean formulas and for parsers and writers.
• examples.QbfReasonersExample.java: Examples for using QBF solvers.

Resources:

• resources.qcir-example1.qcir
• resources.qcir-example2-sat.qcir
• resources.qcir-example2-unsat.qcir
• resources.qdimacs-example1.qdimacs
• resources.qdimacs-example2.qdimacs
• resources.tweety-example.qbf
• resources.qcir-example1.qcir
• resources.qcir-example2-sat.qcir
• resources.qcir-example2-unsat.qcir
• resources.qdimacs-example1.qdimacs
• resources.qdimacs-example2.qdimacs
• resources.tweety-example.qbf

Relational Conditional Logic Library (org.tweetyproject.logics.rcl)

Example code:

• examples.RclExample.java: Example code illustrating the use of working with relational conditionals and using c reasoning.
• examples.RclExample.java: Example code illustrating the use of working with relational conditionals and using c reasoning.

Resources:

no resources available

Reiter's Default Logic Library (org.tweetyproject.logics.rdl)

Example code:

• examples.RdlExample.java: Example code illustrating Reiter's default logic.
• examples.RdlExample.java: Example code illustrating Reiter's default logic.

Resources:

• resources.example_default_theory.txt
• resources.simple_default_theory.txt
• resources.example_default_theory.txt
• resources.simple_default_theory.txt

Relational Probabilistic Conditional Logic Library (org.tweetyproject.logics.rpcl)

Example code:

• examples.RpclMeReasonerExample.java: Example code illustrating relational probabilistic conditional logic and reasoning with it.
• examples.RpclMeReasonerExample2.java: Example code illustrating relational probabilistic conditional logic and reasoning with it.
• examples.RpclMeReasonerExample.java: Example code illustrating relational probabilistic conditional logic and reasoning with it.
• examples.RpclMeReasonerExample2.java: Example code illustrating relational probabilistic conditional logic and reasoning with it.

Resources:

• resources.cold.rpcl
• resources.elephants.rpcl
• resources.penguins.rpcl
• resources.cold.rpcl
• resources.elephants.rpcl
• resources.penguins.rpcl

Translators Library (org.tweetyproject.logics.translators)

Example code:

no example code available

Resources:

• resources.adf.txt
• resources.possibilistic_adf_ex8.txt
• resources.possibilistic_adf_previous_ex6_ex8.txt
• resources.possibilistic_adf_previous_ex7.txt
• resources.preferred_ex8_adf.txt
• resources.preferred_ex8_psi.txt
• resources.adf.txt
• resources.possibilistic_adf_ex8.txt
• resources.possibilistic_adf_previous_ex6_ex8.txt
• resources.possibilistic_adf_previous_ex7.txt
• resources.preferred_ex8_adf.txt
• resources.preferred_ex8_psi.txt

---

Logic Programming Libraries

ASP Library (org.tweetyproject.lp.asp)

Example code:

• examples.ASPExample.java: Example code for creating basic ASP programs and calling solvers and grounders. parse the same examples using the parser.
  Tested with clingo 5.4.0
• examples.ASPParserExample.java: Examples for parsing programs in Clingo and DLV syntax and using the respective solvers to solve them.
  Tested with clingo 5.4.0 and DLV dec-17-2012
• examples.AggregateExample.java: Some more examples on how aggregates work. Note that you can also parse aggregates using ASPParser, which is easier than manually creating them for bigger examples.
  Tested with clingo 5.4.0
• examples.GrounderExample.java
• examples.OptimizeExample.java: An example for using optimization statements, taken from the clingo guide, chapter 3.1.13 https://github.com/potassco/guide.
  Tested with clingo 5.4.0
• examples.ASPExample.java: Example code for creating basic ASP programs and calling solvers and grounders. parse the same examples using the parser.
  Tested with clingo 5.4.0
• examples.ASPParserExample.java: Examples for parsing programs in Clingo and DLV syntax and using the respective solvers to solve them.
  Tested with clingo 5.4.0 and DLV dec-17-2012
• examples.AggregateExample.java: Some more examples on how aggregates work. Note that you can also parse aggregates using ASPParser, which is easier than manually creating them for bigger examples.
  Tested with clingo 5.4.0
• examples.GrounderExample.java
• examples.OptimizeExample.java: An example for using optimization statements, taken from the clingo guide, chapter 3.1.13 https://github.com/potassco/guide.
  Tested with clingo 5.4.0

Resources:

• resources.Krue2008_Ex1_Part1.dl
• resources.Krue2008_Ex1_Part2.dl
• resources.Krue2008_Ex1_Part3.dl
• resources.Krue2008_Ex1_Res.dl
• resources.Krue2008_Ex2_Part1.dl
• resources.Krue2008_Ex2_Part2.dl
• resources.aggregates.asp
• resources.ex1.asp
• resources.ex2.asp
• resources.ex3.asp
• resources.ex4.asp
• resources.ex5.asp
• resources.ex6.asp
• resources.fibonacci.dlv
• resources.latin_square_problem.dlv
• resources.optimize.aspif
• resources.puzzle5.dlv
• resources.Krue2008_Ex1_Part1.dl
• resources.Krue2008_Ex1_Part2.dl
• resources.Krue2008_Ex1_Part3.dl
• resources.Krue2008_Ex1_Res.dl
• resources.Krue2008_Ex2_Part1.dl
• resources.Krue2008_Ex2_Part2.dl
• resources.aggregates.asp
• resources.ex1.asp
• resources.ex2.asp
• resources.ex3.asp
• resources.ex4.asp
• resources.ex5.asp
• resources.ex6.asp
• resources.fibonacci.dlv
• resources.latin_square_problem.dlv
• resources.optimize.aspif
• resources.puzzle5.dlv

ASP Belief Dynamics (org.tweetyproject.lp.asp.beliefdynamics)

Example code:

no example code available

Resources:

no resources available

Nested Logic Programs (org.tweetyproject.lp.nlp)

Example code:

no example code available

Resources:

no resources available

---

Argumentation Libraries

ABA Library (org.tweetyproject.arg.aba)

Example code:

• examples.AbaExample.java: Shows some simple code for working with ABA, including how to parse an ABA file and how to ask queries.
• examples.AbaExample.java: Shows some simple code for working with ABA, including how to parse an ABA file and how to ask queries.

Resources:

• resources.example1.aba
• resources.example11.aba
• resources.example2.aba
• resources.example3.aba
• resources.example4.aba
• resources.example5.aba
• resources.smp_fol.aba
• resources.example1.aba
• resources.example11.aba
• resources.example2.aba
• resources.example3.aba
• resources.example4.aba
• resources.example5.aba
• resources.smp_fol.aba

ADF Library (org.tweetyproject.arg.adf)

Example code:

• examples.ADFExample.java: Example code illustrating Abstract Dialectical Frameworks (ADFs) with different semantics.
• examples.ADFExample.java: Example code illustrating Abstract Dialectical Frameworks (ADFs) with different semantics.

Resources:

• resources.adf_example.txt
• resources.lingeling.dll
• resources.lingeling.so
• resources.minisat.dll
• resources.minisat.so
• resources.picosat.dll
• resources.picosat.so
• resources.adf_example.txt
• resources.lingeling.dll
• resources.lingeling.so
• resources.minisat.dll
• resources.minisat.so
• resources.picosat.dll
• resources.picosat.so

ASPIC Library (org.tweetyproject.arg.aspic)

Example code:

• examples.AspicExample.java: ASPIC example code that shows how to construct an ASPIC theory programmatically.
• examples.AspicExample2.java: ASPIC example code that shows how to parse an ASPIC file and ask queries.
• examples.AspicExampleFol.java: Example code for using ASPIC with first-order-logic formulas.
• examples.AspicGeneratorExample.java: Exemplary code illustrating the use of the ASPIC theory generator. Furthermore, this code show a small performance comparison between the naive ASPIC reasoner, the module based reasoner, directional reasoner, and the random reasoner.
• examples.AspicGeneratorExample2.java: This code shows the use of the ASPIC theory generator. It generates some random ASPIC theories, constructs the corresponding AF graphs, and writes them to a specific folder.
• examples.AspicGeneratorExample3.java: This code shows the use of the ASPIC theory generator. It generates some random ASPIC theories with some parameter combinations and writes them to disk.
• examples.DirectionalReasonerTest.java: Test runtime of module-based vs. directional reasoners. Also checks if they give the same answers
• examples.AspicExample.java: ASPIC example code that shows how to construct an ASPIC theory programmatically.
• examples.AspicExample2.java: ASPIC example code that shows how to parse an ASPIC file and ask queries.
• examples.AspicExampleFol.java: Example code for using ASPIC with first-order-logic formulas.
• examples.AspicGeneratorExample.java: Exemplary code illustrating the use of the ASPIC theory generator. Furthermore, this code show a small performance comparison between the naive ASPIC reasoner, the module based reasoner, directional reasoner, and the random reasoner.
• examples.AspicGeneratorExample2.java: This code shows the use of the ASPIC theory generator. It generates some random ASPIC theories, constructs the corresponding AF graphs, and writes them to a specific folder.
• examples.AspicGeneratorExample3.java: This code shows the use of the ASPIC theory generator. It generates some random ASPIC theories with some parameter combinations and writes them to disk.
• examples.DirectionalReasonerTest.java: Test runtime of module-based vs. directional reasoners. Also checks if they give the same answers

Resources:

• resources.ex1.aspic
• resources.ex2.aspic
• resources.ex3.aspic
• resources.ex4.aspic
• resources.ex5_fol.aspic
• resources.ex1.aspic
• resources.ex2.aspic
• resources.ex3.aspic
• resources.ex4.aspic
• resources.ex5_fol.aspic

Bipolar Argumentation Library (org.tweetyproject.arg.bipolar)

Example code:

• examples.AllPEAFInducerExample.java
• examples.ApproximateJustificationAnalysisExample.java
• examples.CheckIfSelfSupportingExample.java
• examples.DeductiveArgumentation.java: Examples for constructing deductive argumentation frameworks and computing their extensions.
• examples.EAFExample.java
• examples.EasyPEAFExample.java
• examples.EvidentialAcceptability.java: Examples for evidential argumentation frameworks.
• examples.EvidentialArgumentation.java: More examples for evidential argumentation frameworks.
• examples.EvidentialArgumentation2.java: More examples for evidential argumentation frameworks.
• examples.ExpandMCExample.java
• examples.JustificationAnalysisExample.java
• examples.LiThesisPage21EAFExample.java
• examples.MeetingPEAFExample.java
• examples.NecessityArgumentation.java: Examples for necessity argumentation frameworks.
• examples.OrenEtAl2010Figure2Example.java
• examples.SomePEAFInducerExample.java
• examples.admissibleExample.java
• examples.AllPEAFInducerExample.java
• examples.ApproximateJustificationAnalysisExample.java
• examples.CheckIfSelfSupportingExample.java
• examples.DeductiveArgumentation.java: Examples for constructing deductive argumentation frameworks and computing their extensions.
• examples.EAFExample.java
• examples.EasyPEAFExample.java
• examples.EvidentialAcceptability.java: Examples for evidential argumentation frameworks.
• examples.EvidentialArgumentation.java: More examples for evidential argumentation frameworks.
• examples.EvidentialArgumentation2.java: More examples for evidential argumentation frameworks.
• examples.ExpandMCExample.java
• examples.JustificationAnalysisExample.java
• examples.LiThesisPage21EAFExample.java
• examples.MeetingPEAFExample.java
• examples.NecessityArgumentation.java: Examples for necessity argumentation frameworks.
• examples.OrenEtAl2010Figure2Example.java
• examples.SomePEAFInducerExample.java
• examples.admissibleExample.java

Resources:

no resources available

Deductive Argumentation Library (org.tweetyproject.arg.deductive)

Example code:

• examples.DeductiveExample.java: Shows how to construct and query a deductive knowledge base.
• examples.SimplePlLogicExample.java: Example code for simple logic argumentation.
• examples.DeductiveExample.java: Shows how to construct and query a deductive knowledge base.
• examples.SimplePlLogicExample.java: Example code for simple logic argumentation.

Resources:

no resources available

Defeasible Logic Programming Library (org.tweetyproject.arg.delp)

Example code:

• examples.DeLPExample.java: Shows how to parse and query a DeLP program.
• examples.DeLPExample.java: Shows how to parse and query a DeLP program.

Resources:

• resources.birds.txt
• resources.birds.txt
• resources.birds2.txt
• resources.counterarg.txt
• resources.counterarg.txt
• resources.dtree.txt
• resources.dtree.txt
• resources.hobbes.txt
• resources.hobbes.txt
• resources.nixon.txt
• resources.nixon.txt
• resources.stocks.txt
• resources.stocks.txt
• resources.birds.txt
• resources.birds.txt
• resources.birds2.txt
• resources.counterarg.txt
• resources.counterarg.txt
• resources.dtree.txt
• resources.dtree.txt
• resources.hobbes.txt
• resources.hobbes.txt
• resources.nixon.txt
• resources.nixon.txt
• resources.stocks.txt
• resources.stocks.txt

Dung Argumentation Library (org.tweetyproject.arg.dung)

Example code:

• examples.AFLearnerExample.java: Showcasing how to use the implementation of the learning algorithm
• examples.AcceptabilityReasonerExample.java: This example shows how the different acceptability reasoners work.
• examples.CF2Example.java: Example code for CF2 semantics. Shows how to construct an abstract argumentation framework programmatically and how to reason with it using CF2 semantics.
• examples.ClaimBasedReasonersTest.java: test for claim based reasoners
• examples.DivisionExample.java: Example code for working with divisions.
• examples.DungTheoryGeneratorExample.java: Example code for generating dung theories and exporting them to apx format.
• examples.DungTheoryPlotterExample.java
• examples.EquivalenceClassifierExample.java
• examples.EquivalenceCompExFinderExample.java
• examples.ExampleFinderExample.java: example to show the use of the ExampleFinder class
• examples.ExtendedExampleFinderExample.java: example to show the use of the ExtendedExampleFinder class
• examples.ExtensionRankingExample.java: Example on how to use the OrderingSemanticsReasoner.
• examples.IncompleteReasonerExample.java: example of a problem for an incomplete reasoner
• examples.IndependenceExample.java: Example usage of the Independence class example theory taken from: Rienstra, Tjitze, et al. "Independence and D-separation in Abstract Argumentation." Proceedings of the International Conference on Principles of Knowledge Representation and Reasoning. Vol. 17. No. 1. 2020.
• examples.KwtGeneratorExample.java: Example code for generating a lot of KWT graphs.
• examples.LearningExample.java: Argument Learning example.
• examples.NiskanenExample.java: description missing
• examples.PrincipleExample.java: Example code for principles for argumentation semantics
• examples.QualifiedExample.java: Example on how to use the qualified and semi-qualified semantics reasoners.
• examples.ResolutionbasedSolverTest.java: description missing
• examples.SerialisableExtensionReasonerExample.java: for different types of serialisable semantics.
  
  See
  
  Matthias Thimm. Revisiting initial sets in abstract argumentation.
  Argument and Computation 13 (2022) 325–360
  DOI 10.3233/AAC-210018
  
  and
  
  Lars Bengel and Matthias Thimm. Serialisable Semantics for Abstract Argumentation.
  Computational Models of Argument (2022)
  DOI: 10.3233/FAIA220143
• examples.SerialisationAnalysisPlotterExample.java
• examples.SerialisationGraphGeneratorExample.java: for a chosen type of serialisable semantics.
  Reference: Matthias Thimm. Revisiting initial sets in abstract argumentation. Argument and Computation 13 (2022) 325–360 DOI 10.3233/AAC-210018
  Reference: Lars Bengel and Matthias Thimm. Serialisable Semantics for Abstract Argumentation. Computational Models of Argument (2022) DOI: 10.3233/FAIA220143
• examples.SerialisationGraphPlotterExample.java: for a chosen type of serialisable semantics.
  
  See
  
  Matthias Thimm. Revisiting initial sets in abstract argumentation.
  Argument and Computation 13 (2022) 325–360
  DOI 10.3233/AAC-210018
  
  and
  
  Lars Bengel and Matthias Thimm. Serialisable Semantics for Abstract Argumentation.
  Computational Models of Argument (2022)
  DOI: 10.3233/FAIA220143
• examples.StratifiedLabelingExample.java: Example code for using stratified labelings by Thimm/Kern-Isberner.
• examples.StrongAdmissibleExample.java: description missing
• examples.StrongEquivalenceExample.java: Example usage of the StrongEquivalenceChecker class
• examples.VacuousReductReasonerExample.java: example for the vacuous reduct reasoner
• examples.WeakSemanticsExample.java: Example usage of the reasoner for weak semantics
• examples.AFLearnerExample.java: Showcasing how to use the implementation of the learning algorithm
• examples.AcceptabilityReasonerExample.java: This example shows how the different acceptability reasoners work.
• examples.CF2Example.java: Example code for CF2 semantics. Shows how to construct an abstract argumentation framework programmatically and how to reason with it using CF2 semantics.
• examples.ClaimBasedReasonersTest.java: test for claim based reasoners
• examples.DivisionExample.java: Example code for working with divisions.
• examples.DungTheoryGeneratorExample.java: Example code for generating dung theories and exporting them to apx format.
• examples.DungTheoryPlotterExample.java
• examples.EquivalenceClassifierExample.java
• examples.EquivalenceCompExFinderExample.java
• examples.ExampleFinderExample.java: example to show the use of the ExampleFinder class
• examples.ExtendedExampleFinderExample.java: example to show the use of the ExtendedExampleFinder class
• examples.ExtensionRankingExample.java: Example on how to use the OrderingSemanticsReasoner.
• examples.IncompleteReasonerExample.java: example of a problem for an incomplete reasoner
• examples.IndependenceExample.java: Example usage of the Independence class example theory taken from: Rienstra, Tjitze, et al. "Independence and D-separation in Abstract Argumentation." Proceedings of the International Conference on Principles of Knowledge Representation and Reasoning. Vol. 17. No. 1. 2020.
• examples.KwtGeneratorExample.java: Example code for generating a lot of KWT graphs.
• examples.LearningExample.java: Argument Learning example.
• examples.NiskanenExample.java: description missing
• examples.PrincipleExample.java: Example code for principles for argumentation semantics
• examples.QualifiedExample.java: Example on how to use the qualified and semi-qualified semantics reasoners.
• examples.ResolutionbasedSolverTest.java: description missing
• examples.SerialisableExtensionReasonerExample.java: for different types of serialisable semantics.
  
  See
  
  Matthias Thimm. Revisiting initial sets in abstract argumentation.
  Argument and Computation 13 (2022) 325–360
  DOI 10.3233/AAC-210018
  
  and
  
  Lars Bengel and Matthias Thimm. Serialisable Semantics for Abstract Argumentation.
  Computational Models of Argument (2022)
  DOI: 10.3233/FAIA220143
• examples.SerialisationAnalysisPlotterExample.java
• examples.SerialisationGraphGeneratorExample.java: for a chosen type of serialisable semantics.
  Reference: Matthias Thimm. Revisiting initial sets in abstract argumentation. Argument and Computation 13 (2022) 325–360 DOI 10.3233/AAC-210018
  Reference: Lars Bengel and Matthias Thimm. Serialisable Semantics for Abstract Argumentation. Computational Models of Argument (2022) DOI: 10.3233/FAIA220143
• examples.SerialisationGraphPlotterExample.java: for a chosen type of serialisable semantics.
  
  See
  
  Matthias Thimm. Revisiting initial sets in abstract argumentation.
  Argument and Computation 13 (2022) 325–360
  DOI 10.3233/AAC-210018
  
  and
  
  Lars Bengel and Matthias Thimm. Serialisable Semantics for Abstract Argumentation.
  Computational Models of Argument (2022)
  DOI: 10.3233/FAIA220143
• examples.StratifiedLabelingExample.java: Example code for using stratified labelings by Thimm/Kern-Isberner.
• examples.StrongAdmissibleExample.java: description missing
• examples.StrongEquivalenceExample.java: Example usage of the StrongEquivalenceChecker class
• examples.VacuousReductReasonerExample.java: example for the vacuous reduct reasoner
• examples.WeakSemanticsExample.java: Example usage of the reasoner for weak semantics

Resources:

• resources.ex1.apx
• resources.ex1.tgf
• resources.ex2.apx
• resources.ex2.tgf
• resources.ex3.apx
• resources.ex3.tgf
• resources.ex1.apx
• resources.ex1.tgf
• resources.ex2.apx
• resources.ex2.tgf
• resources.ex3.apx
• resources.ex3.tgf

Logic Programming Argumentation Library (org.tweetyproject.arg.lp)

Example code:

no example code available

Resources:

no resources available

Probabilistic Argumentation Library (org.tweetyproject.arg.prob)

Example code:

• examples.LotteryExample.java: Example code for working with lotteries in probabilistic abstract argumentation.
• examples.PAInconsistencyMeasureExample.java: Example code for the PAInconsistencyMeasure.
• examples.SubgraphProbExample.java: Example code for showing how to work with subgraph probability distributions and updates.
• examples.LotteryExample.java: Example code for working with lotteries in probabilistic abstract argumentation.
• examples.PAInconsistencyMeasureExample.java: Example code for the PAInconsistencyMeasure.
• examples.SubgraphProbExample.java: Example code for showing how to work with subgraph probability distributions and updates.

Resources:

no resources available

Ranking Semantics for Argumentation Library (org.tweetyproject.arg.rankings)

Example code:

• examples.CounterTransitivityReasonerExample.java
• examples.IteratedGradedDefenseReasonerExample.java: Example code for using the iterated graded semantics from [Grossi, Modgil. On the Graded Acceptability of Arguments. IJCAI 2015].
• examples.ProbabilisticRankingReasonerExample.java: Example code for using the probabilistic ranking reasoner based on the ideas from [Thimm, Cerutti, Rienstra. Probabilistic Graded Semantics. COMMA 2018].
• examples.RankingPostulatesExample.java: Example code for evaluating ranking semantics in regard to postulates. Each postulate represents a single property that characterizes how the semantics ranks arguments.
• examples.RankingSemanticsExample.java: Example code for the following ranking semantics:
  - Categorizer [Besnard, Hunter. A logic-based theory of deductive arguments. 2001]
  - Burden-Based [Amgoud, Ben-Naim. Ranking-based semantics for argumentation frameworks. 2013]
  - Discussion-Based [Amgoud, Ben-Naim. Ranking-based semantics for argumentation frameworks. 2013]
  - Tuples [Cayrol, Lagasquie-Schiex. Graduality in argumentation. 2005]
  - Strategy-Based [Matt, Toni. A game-theoretic measure of argument strength for abstract argumentation. JELIA 2008]
  - Social Abstract Argumentation with simple product semantics [Bonzon, Delobelle, Konieczny, Maudet. A Comparative Study of Ranking-Based Semantics for Abstract Argumentation. AAAI 2016]
  - Iterated Graded Defense [Grossi, Modgil. On the Graded Acceptability of Arguments. IJCAI 2015]
  - Probabilistic Graded Semantics [Thimm, Cerutti, Rienstra. Probabilistic Graded Semantics. COMMA 2018].
• examples.RankingSemanticsExample2.java: Example code for even more ranking semantics:
  - Counting Semantics [Pu, Zhang, G.Luo, J.Luo. Attacker and Defender Counting Approach for Abstract Argumentation. CoRR 2015].
  - The three variations of the Propagation Semantics [Delobelle. Ranking-based Semantics for Abstract Argumentation. Thesis, 2017])
• examples.SerialisableRankingReasonerExample.java
• examples.CounterTransitivityReasonerExample.java
• examples.IteratedGradedDefenseReasonerExample.java: Example code for using the iterated graded semantics from [Grossi, Modgil. On the Graded Acceptability of Arguments. IJCAI 2015].
• examples.ProbabilisticRankingReasonerExample.java: Example code for using the probabilistic ranking reasoner based on the ideas from [Thimm, Cerutti, Rienstra. Probabilistic Graded Semantics. COMMA 2018].
• examples.RankingPostulatesExample.java: Example code for evaluating ranking semantics in regard to postulates. Each postulate represents a single property that characterizes how the semantics ranks arguments.
• examples.RankingSemanticsExample.java: Example code for the following ranking semantics:
  - Categorizer [Besnard, Hunter. A logic-based theory of deductive arguments. 2001]
  - Burden-Based [Amgoud, Ben-Naim. Ranking-based semantics for argumentation frameworks. 2013]
  - Discussion-Based [Amgoud, Ben-Naim. Ranking-based semantics for argumentation frameworks. 2013]
  - Tuples [Cayrol, Lagasquie-Schiex. Graduality in argumentation. 2005]
  - Strategy-Based [Matt, Toni. A game-theoretic measure of argument strength for abstract argumentation. JELIA 2008]
  - Social Abstract Argumentation with simple product semantics [Bonzon, Delobelle, Konieczny, Maudet. A Comparative Study of Ranking-Based Semantics for Abstract Argumentation. AAAI 2016]
  - Iterated Graded Defense [Grossi, Modgil. On the Graded Acceptability of Arguments. IJCAI 2015]
  - Probabilistic Graded Semantics [Thimm, Cerutti, Rienstra. Probabilistic Graded Semantics. COMMA 2018].
• examples.RankingSemanticsExample2.java: Example code for even more ranking semantics:
  - Counting Semantics [Pu, Zhang, G.Luo, J.Luo. Attacker and Defender Counting Approach for Abstract Argumentation. CoRR 2015].
  - The three variations of the Propagation Semantics [Delobelle. Ranking-based Semantics for Abstract Argumentation. Thesis, 2017])
• examples.SerialisableRankingReasonerExample.java

Resources:

• resources.ex1_bonzon.apx
• resources.ex2_baumeister.apx
• resources.ex3_cayrol.apx
• resources.ex1_bonzon.apx
• resources.ex2_baumeister.apx
• resources.ex3_cayrol.apx

Structured Argumentation Frameworks Library (org.tweetyproject.arg.saf)

Example code:

no example code available

Resources:

no resources available

SetAFs (org.tweetyproject.arg.setaf)

Example code:

• examples.SetAfTheoryTest.java: Examples of SetAf Theorys and their semantics
• examples.SetAfTheoryTest.java: Examples of SetAf Theorys and their semantics

Resources:

• resources.ex1.apx
• resources.ex1.tgf
• resources.ex2.apx
• resources.ex2.tgf
• resources.ex3.apx
• resources.ex3.tgf
• resources.ex1.apx
• resources.ex1.tgf
• resources.ex2.apx
• resources.ex2.tgf
• resources.ex3.apx
• resources.ex3.tgf

Social Abstract Argumentation Library (org.tweetyproject.arg.social)

Example code:

• examples.SafExample.java: Example code for using social abstract argumentation.
• examples.SafExample.java: Example code for using social abstract argumentation.

Resources:

no resources available

---

Agent Libraries

Agents Library (org.tweetyproject.agents)

Example code:

no example code available

Resources:

no resources available

Dialogue Systems Library (org.tweetyproject.agents.dialogues)

Example code:

• examples.GroundedTest.java: Shows how a simulation of a multi-agent system can be set up. It defines a dialogue game between different agents with varying complexity of their opponent models.
• examples.GroundedTest2.java: Shows how a simulation of a multi-agent system can be set up. It defines a dialogue game between different agents with varying complexity of their opponent models.
• examples.LotteryDialogueTest.java: Shows how a simulation of a multi-agent system can be set up. It defines a dialogue game between different agents, in particular one based on an action selection strategy using lotteries.
• examples.LotteryDialogueTest2.java: Main class for empirical evaluation in [Hunter, Thimm. 2015, to appear]. Shows how a simulation of a multi-agent system can be set up. It defines a dialogue game between different agents, in particular one based on an action selection strategy using lotteries.
• examples.GroundedTest.java: Shows how a simulation of a multi-agent system can be set up. It defines a dialogue game between different agents with varying complexity of their opponent models.
• examples.GroundedTest2.java: Shows how a simulation of a multi-agent system can be set up. It defines a dialogue game between different agents with varying complexity of their opponent models.
• examples.LotteryDialogueTest.java: Shows how a simulation of a multi-agent system can be set up. It defines a dialogue game between different agents, in particular one based on an action selection strategy using lotteries.
• examples.LotteryDialogueTest2.java: Main class for empirical evaluation in [Hunter, Thimm. 2015, to appear]. Shows how a simulation of a multi-agent system can be set up. It defines a dialogue game between different agents, in particular one based on an action selection strategy using lotteries.

Resources:

no resources available

---

Other Libraries

Action and Change (org.tweetyproject.action)

Example code:

no example code available

Resources:

• resources.conditioner.desc
• resources.monkey.desc
• resources.monkey.query
• resources.monkey.sig
• resources.turkey.desc
• resources.water.query
• resources.conditioner.desc
• resources.monkey.desc
• resources.monkey.query
• resources.monkey.sig
• resources.turkey.desc
• resources.water.query

Belief Dynamics Library (org.tweetyproject.beliefdynamics)

Example code:

• examples.AbstractArgumentationExample.java: Example code for applying belief dynamics on abstract argumentation frameworks.
• examples.CrMasExample.java: Example code on using belief operators in multi-agent settings.
• examples.AbstractArgumentationExample.java: Example code for applying belief dynamics on abstract argumentation frameworks.
• examples.CrMasExample.java: Example code on using belief operators in multi-agent settings.

Resources:

no resources available

Machine Learning Library (org.tweetyproject.machinelearning)

Example code:

• examples.FpGrowthExample.java: An example for the FP-Growth algorithm
• examples.MdpExample.java: Illustrates the use of Markov Decision Processes using a vacuum cleaner example.
• examples.SvmExample.java: Illustrates the use of support vector machine learning.
• examples.FpGrowthExample.java: An example for the FP-Growth algorithm
• examples.MdpExample.java: Illustrates the use of Markov Decision Processes using a vacuum cleaner example.
• examples.SvmExample.java: Illustrates the use of support vector machine learning.

Resources:

no resources available

Preferences Library (org.tweetyproject.preferences)

Example code:

no example code available

Resources:

• resources.TestA.po
• resources.TestB.po
• resources.TestC.po
• resources.TestD.po
• resources.TestE.po
• resources.TestA.po
• resources.TestB.po
• resources.TestC.po
• resources.TestD.po
• resources.TestE.po

SAT Library (org.tweetyproject.sat)

Example code:

no example code available

Resources:

• resources.lingeling.dll
• resources.lingeling.so
• resources.minisat.dll
• resources.minisat.so
• resources.picosat.dll
• resources.picosat.so
• resources.lingeling.dll
• resources.lingeling.so
• resources.minisat.dll
• resources.minisat.so
• resources.picosat.dll
• resources.picosat.so

Web Services (org.tweetyproject.web)

Example code:

no example code available

Resources:

• resources.application.properties
• resources.application.properties

back

Last updated 18.01.2024, Matthias Thimm | Terms